./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 e19ca921 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-e19ca92 [2021-12-22 13:57:34,287 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-22 13:57:34,289 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-22 13:57:34,341 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-22 13:57:34,344 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-22 13:57:34,345 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-22 13:57:34,346 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-22 13:57:34,349 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-22 13:57:34,351 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-22 13:57:34,352 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-22 13:57:34,352 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-22 13:57:34,353 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-22 13:57:34,354 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-22 13:57:34,356 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-22 13:57:34,357 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-22 13:57:34,358 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-22 13:57:34,358 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-22 13:57:34,360 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-22 13:57:34,362 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-22 13:57:34,366 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-22 13:57:34,370 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-22 13:57:34,371 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-22 13:57:34,372 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-22 13:57:34,373 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-22 13:57:34,374 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-22 13:57:34,375 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-22 13:57:34,377 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-22 13:57:34,378 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-22 13:57:34,379 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-22 13:57:34,379 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-22 13:57:34,379 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-22 13:57:34,380 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-22 13:57:34,380 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-22 13:57:34,381 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-22 13:57:34,382 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-22 13:57:34,382 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-22 13:57:34,383 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-22 13:57:34,383 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-22 13:57:34,384 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-22 13:57:34,384 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-22 13:57:34,384 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-22 13:57:34,385 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-12-22 13:57:34,399 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-22 13:57:34,401 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-22 13:57:34,402 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-22 13:57:34,402 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-22 13:57:34,403 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-22 13:57:34,403 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-22 13:57:34,404 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-22 13:57:34,404 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-22 13:57:34,404 INFO L138 SettingsManager]: * Use SBE=true [2021-12-22 13:57:34,404 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-22 13:57:34,405 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-22 13:57:34,405 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-22 13:57:34,405 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-22 13:57:34,405 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-22 13:57:34,405 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-22 13:57:34,406 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-22 13:57:34,406 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-22 13:57:34,406 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-22 13:57:34,406 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-22 13:57:34,406 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-22 13:57:34,406 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-22 13:57:34,406 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 13:57:34,407 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-22 13:57:34,407 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-22 13:57:34,407 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-22 13:57:34,407 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-22 13:57:34,407 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-22 13:57:34,408 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-22 13:57:34,408 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-22 13:57:34,409 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-22 13:57:34,409 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-22 13:57:34,409 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-22 13:57:34,620 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-22 13:57:34,638 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-22 13:57:34,641 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-22 13:57:34,642 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-22 13:57:34,643 INFO L275 PluginConnector]: CDTParser initialized [2021-12-22 13:57:34,644 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-22 13:57:34,687 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28d22e077/30c05c6bd4f246b8b263f03a2ea45d98/FLAGc3e27637b [2021-12-22 13:57:35,243 INFO L306 CDTParser]: Found 1 translation units. [2021-12-22 13:57:35,243 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_from_array_harness.i [2021-12-22 13:57:35,277 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28d22e077/30c05c6bd4f246b8b263f03a2ea45d98/FLAGc3e27637b [2021-12-22 13:57:35,414 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28d22e077/30c05c6bd4f246b8b263f03a2ea45d98 [2021-12-22 13:57:35,417 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-22 13:57:35,419 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-22 13:57:35,421 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-22 13:57:35,421 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-22 13:57:35,424 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-22 13:57:35,425 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 01:57:35" (1/1) ... [2021-12-22 13:57:35,427 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38968129 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:57:35, skipping insertion in model container [2021-12-22 13:57:35,427 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 01:57:35" (1/1) ... [2021-12-22 13:57:35,431 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-22 13:57:35,507 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-22 13:57:35,713 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-22 13:57:35,718 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-22 13:57:36,225 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:57:36,226 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:57:36,227 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:57:36,228 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:57:36,229 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:57:36,243 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:57:36,244 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:57:36,245 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:57:36,246 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:57:36,458 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-22 13:57:36,459 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-22 13:57:36,459 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-22 13:57:36,460 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-22 13:57:36,461 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-22 13:57:36,461 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-22 13:57:36,461 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-22 13:57:36,462 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-22 13:57:36,462 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-22 13:57:36,462 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-22 13:57:36,560 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-22 13:57:36,640 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:57:36,640 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:57:36,695 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 13:57:36,727 INFO L203 MainTranslator]: Completed pre-run [2021-12-22 13:57:36,735 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-22 13:57:36,736 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-22 13:57:36,751 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:57:36,752 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:57:36,752 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:57:36,752 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:57:36,752 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:57:36,755 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:57:36,756 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:57:36,756 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:57:36,756 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:57:36,771 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-22 13:57:36,772 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-22 13:57:36,772 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-22 13:57:36,772 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-22 13:57:36,773 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-22 13:57:36,773 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-22 13:57:36,773 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-22 13:57:36,774 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-22 13:57:36,774 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-22 13:57:36,774 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-22 13:57:36,784 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-22 13:57:36,809 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:57:36,809 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-22 13:57:36,831 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 13:57:37,004 INFO L208 MainTranslator]: Completed translation [2021-12-22 13:57:37,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:57:37 WrapperNode [2021-12-22 13:57:37,005 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-22 13:57:37,006 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-22 13:57:37,006 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-22 13:57:37,006 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-22 13:57:37,011 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:57:37" (1/1) ... [2021-12-22 13:57:37,121 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:57:37" (1/1) ... [2021-12-22 13:57:37,180 INFO L137 Inliner]: procedures = 690, calls = 2609, calls flagged for inlining = 59, calls inlined = 5, statements flattened = 777 [2021-12-22 13:57:37,180 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-22 13:57:37,181 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-22 13:57:37,181 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-22 13:57:37,181 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-22 13:57:37,187 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:57:37" (1/1) ... [2021-12-22 13:57:37,188 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:57:37" (1/1) ... [2021-12-22 13:57:37,192 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:57:37" (1/1) ... [2021-12-22 13:57:37,193 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:57:37" (1/1) ... [2021-12-22 13:57:37,213 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:57:37" (1/1) ... [2021-12-22 13:57:37,215 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:57:37" (1/1) ... [2021-12-22 13:57:37,220 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:57:37" (1/1) ... [2021-12-22 13:57:37,227 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-22 13:57:37,228 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-22 13:57:37,228 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-22 13:57:37,228 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-22 13:57:37,229 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:57:37" (1/1) ... [2021-12-22 13:57:37,234 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 13:57:37,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 13:57:37,263 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-22 13:57:37,297 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-22 13:57:37,313 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_is_valid [2021-12-22 13:57:37,313 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_is_valid [2021-12-22 13:57:37,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-22 13:57:37,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-22 13:57:37,314 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-22 13:57:37,314 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-22 13:57:37,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-22 13:57:37,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-22 13:57:37,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-22 13:57:37,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-22 13:57:37,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-22 13:57:37,316 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2021-12-22 13:57:37,317 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2021-12-22 13:57:37,317 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-12-22 13:57:37,318 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-12-22 13:57:37,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-22 13:57:37,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-22 13:57:37,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-22 13:57:37,318 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2021-12-22 13:57:37,318 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2021-12-22 13:57:37,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-22 13:57:37,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-22 13:57:37,521 INFO L234 CfgBuilder]: Building ICFG [2021-12-22 13:57:37,523 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-22 13:57:38,194 INFO L275 CfgBuilder]: Performing block encoding [2021-12-22 13:57:38,201 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-22 13:57:38,201 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-22 13:57:38,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 01:57:38 BoogieIcfgContainer [2021-12-22 13:57:38,203 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-22 13:57:38,204 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-22 13:57:38,204 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-22 13:57:38,207 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-22 13:57:38,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 01:57:35" (1/3) ... [2021-12-22 13:57:38,207 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4feb5ecc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 01:57:38, skipping insertion in model container [2021-12-22 13:57:38,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:57:37" (2/3) ... [2021-12-22 13:57:38,208 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4feb5ecc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 01:57:38, skipping insertion in model container [2021-12-22 13:57:38,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 01:57:38" (3/3) ... [2021-12-22 13:57:38,209 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_cursor_from_array_harness.i [2021-12-22 13:57:38,215 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-22 13:57:38,215 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-22 13:57:38,271 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-22 13:57:38,279 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-22 13:57:38,280 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-22 13:57:38,300 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-22 13:57:38,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-22 13:57:38,304 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:57:38,305 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-22 13:57:38,305 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:57:38,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:57:38,309 INFO L85 PathProgramCache]: Analyzing trace with hash -860547149, now seen corresponding path program 1 times [2021-12-22 13:57:38,314 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:57:38,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403667123] [2021-12-22 13:57:38,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:57:38,315 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:57:38,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:38,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 13:57:38,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:38,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 13:57:38,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:38,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-22 13:57:38,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:38,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-22 13:57:38,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:38,797 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-22 13:57:38,797 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:57:38,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403667123] [2021-12-22 13:57:38,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403667123] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:57:38,798 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:57:38,798 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 13:57:38,799 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527839885] [2021-12-22 13:57:38,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:57:38,803 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 13:57:38,804 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:57:38,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 13:57:38,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 13:57:38,829 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-22 13:57:38,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:57:38,939 INFO L93 Difference]: Finished difference Result 117 states and 154 transitions. [2021-12-22 13:57:38,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 13:57:38,942 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-22 13:57:38,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:57:38,947 INFO L225 Difference]: With dead ends: 117 [2021-12-22 13:57:38,951 INFO L226 Difference]: Without dead ends: 54 [2021-12-22 13:57:38,954 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-22 13:57:38,960 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-22 13:57:38,961 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-22 13:57:38,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2021-12-22 13:57:38,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2021-12-22 13:57:38,990 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-22 13:57:38,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2021-12-22 13:57:38,992 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 29 [2021-12-22 13:57:38,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:57:38,992 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2021-12-22 13:57:38,992 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-22 13:57:38,993 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2021-12-22 13:57:38,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-22 13:57:38,994 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:57:38,994 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-22 13:57:38,994 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-22 13:57:38,994 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:57:38,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:57:38,995 INFO L85 PathProgramCache]: Analyzing trace with hash 617864563, now seen corresponding path program 1 times [2021-12-22 13:57:38,995 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:57:38,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551060825] [2021-12-22 13:57:38,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:57:38,995 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:57:39,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:39,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 13:57:39,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:39,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 13:57:39,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:39,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-22 13:57:39,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:39,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-22 13:57:39,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:39,156 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-22 13:57:39,157 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:57:39,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551060825] [2021-12-22 13:57:39,157 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551060825] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:57:39,157 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:57:39,157 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 13:57:39,157 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905635963] [2021-12-22 13:57:39,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:57:39,158 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 13:57:39,158 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:57:39,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 13:57:39,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-22 13:57:39,159 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-22 13:57:39,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:57:39,310 INFO L93 Difference]: Finished difference Result 99 states and 119 transitions. [2021-12-22 13:57:39,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 13:57:39,310 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-22 13:57:39,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:57:39,312 INFO L225 Difference]: With dead ends: 99 [2021-12-22 13:57:39,312 INFO L226 Difference]: Without dead ends: 57 [2021-12-22 13:57:39,313 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-22 13:57:39,314 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 45 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 13:57:39,314 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 131 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 13:57:39,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-12-22 13:57:39,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2021-12-22 13:57:39,320 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-22 13:57:39,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2021-12-22 13:57:39,321 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 29 [2021-12-22 13:57:39,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:57:39,322 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2021-12-22 13:57:39,322 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-22 13:57:39,322 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2021-12-22 13:57:39,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-22 13:57:39,323 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:57:39,323 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-22 13:57:39,323 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-22 13:57:39,323 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:57:39,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:57:39,324 INFO L85 PathProgramCache]: Analyzing trace with hash 633470424, now seen corresponding path program 1 times [2021-12-22 13:57:39,324 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:57:39,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847721136] [2021-12-22 13:57:39,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:57:39,324 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:57:39,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:39,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 13:57:39,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:39,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 13:57:39,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:39,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-22 13:57:39,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:39,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-22 13:57:39,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:39,523 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-22 13:57:39,524 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:57:39,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847721136] [2021-12-22 13:57:39,524 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847721136] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:57:39,524 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:57:39,524 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-22 13:57:39,524 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247900560] [2021-12-22 13:57:39,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:57:39,525 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-22 13:57:39,525 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:57:39,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-22 13:57:39,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-22 13:57:39,526 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-22 13:57:39,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:57:39,729 INFO L93 Difference]: Finished difference Result 69 states and 81 transitions. [2021-12-22 13:57:39,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-22 13:57:39,729 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-22 13:57:39,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:57:39,730 INFO L225 Difference]: With dead ends: 69 [2021-12-22 13:57:39,730 INFO L226 Difference]: Without dead ends: 67 [2021-12-22 13:57:39,731 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-22 13:57:39,731 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 47 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 13:57:39,732 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 287 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 13:57:39,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-12-22 13:57:39,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2021-12-22 13:57:39,737 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-22 13:57:39,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 78 transitions. [2021-12-22 13:57:39,738 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 78 transitions. Word has length 31 [2021-12-22 13:57:39,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:57:39,738 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 78 transitions. [2021-12-22 13:57:39,738 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-22 13:57:39,739 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2021-12-22 13:57:39,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-22 13:57:39,739 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:57:39,740 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-22 13:57:39,740 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-22 13:57:39,740 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:57:39,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:57:39,741 INFO L85 PathProgramCache]: Analyzing trace with hash -843890528, now seen corresponding path program 1 times [2021-12-22 13:57:39,741 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:57:39,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785961144] [2021-12-22 13:57:39,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:57:39,741 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:57:39,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:40,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 13:57:40,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:40,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 13:57:40,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:40,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-22 13:57:40,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:40,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-22 13:57:40,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:40,173 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-22 13:57:40,174 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:57:40,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785961144] [2021-12-22 13:57:40,174 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785961144] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:57:40,174 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:57:40,174 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-22 13:57:40,174 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696765612] [2021-12-22 13:57:40,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:57:40,175 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-22 13:57:40,175 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:57:40,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-22 13:57:40,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-12-22 13:57:40,177 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-22 13:57:40,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:57:40,489 INFO L93 Difference]: Finished difference Result 127 states and 150 transitions. [2021-12-22 13:57:40,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-22 13:57:40,489 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-22 13:57:40,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:57:40,490 INFO L225 Difference]: With dead ends: 127 [2021-12-22 13:57:40,490 INFO L226 Difference]: Without dead ends: 78 [2021-12-22 13:57:40,491 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-22 13:57:40,491 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 86 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 13:57:40,491 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 262 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 13:57:40,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-12-22 13:57:40,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 70. [2021-12-22 13:57:40,496 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-22 13:57:40,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 83 transitions. [2021-12-22 13:57:40,497 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 83 transitions. Word has length 35 [2021-12-22 13:57:40,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:57:40,498 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 83 transitions. [2021-12-22 13:57:40,498 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-22 13:57:40,498 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2021-12-22 13:57:40,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-22 13:57:40,499 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:57:40,499 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-22 13:57:40,499 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-22 13:57:40,499 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:57:40,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:57:40,500 INFO L85 PathProgramCache]: Analyzing trace with hash -585725090, now seen corresponding path program 1 times [2021-12-22 13:57:40,500 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:57:40,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860762249] [2021-12-22 13:57:40,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:57:40,500 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:57:40,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:40,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 13:57:40,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:40,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 13:57:40,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:40,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-22 13:57:40,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:40,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-22 13:57:40,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:40,664 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-22 13:57:40,664 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:57:40,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860762249] [2021-12-22 13:57:40,664 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860762249] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:57:40,665 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:57:40,665 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 13:57:40,665 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955139903] [2021-12-22 13:57:40,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:57:40,665 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 13:57:40,665 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:57:40,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 13:57:40,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 13:57:40,666 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-22 13:57:40,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:57:40,788 INFO L93 Difference]: Finished difference Result 121 states and 144 transitions. [2021-12-22 13:57:40,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-22 13:57:40,789 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-22 13:57:40,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:57:40,789 INFO L225 Difference]: With dead ends: 121 [2021-12-22 13:57:40,790 INFO L226 Difference]: Without dead ends: 68 [2021-12-22 13:57:40,790 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-22 13:57:40,791 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 36 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 13:57:40,791 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 132 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 13:57:40,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-12-22 13:57:40,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2021-12-22 13:57:40,795 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-22 13:57:40,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 79 transitions. [2021-12-22 13:57:40,796 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 79 transitions. Word has length 35 [2021-12-22 13:57:40,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:57:40,796 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 79 transitions. [2021-12-22 13:57:40,796 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-22 13:57:40,796 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 79 transitions. [2021-12-22 13:57:40,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-22 13:57:40,797 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:57:40,797 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-22 13:57:40,797 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-22 13:57:40,797 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:57:40,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:57:40,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1626961765, now seen corresponding path program 1 times [2021-12-22 13:57:40,798 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:57:40,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635792083] [2021-12-22 13:57:40,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:57:40,798 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:57:40,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:40,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 13:57:40,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:40,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 13:57:40,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:40,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-22 13:57:40,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:40,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-22 13:57:40,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:40,971 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-22 13:57:40,972 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:57:40,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635792083] [2021-12-22 13:57:40,972 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635792083] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:57:40,972 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:57:40,972 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-22 13:57:40,972 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046656169] [2021-12-22 13:57:40,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:57:40,973 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-22 13:57:40,973 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:57:40,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-22 13:57:40,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-12-22 13:57:40,974 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-22 13:57:41,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:57:41,252 INFO L93 Difference]: Finished difference Result 82 states and 94 transitions. [2021-12-22 13:57:41,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-22 13:57:41,253 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-22 13:57:41,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:57:41,254 INFO L225 Difference]: With dead ends: 82 [2021-12-22 13:57:41,254 INFO L226 Difference]: Without dead ends: 80 [2021-12-22 13:57:41,254 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-22 13:57:41,255 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 49 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 13:57:41,255 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 359 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 13:57:41,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-12-22 13:57:41,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 70. [2021-12-22 13:57:41,259 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-22 13:57:41,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 81 transitions. [2021-12-22 13:57:41,260 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 81 transitions. Word has length 37 [2021-12-22 13:57:41,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:57:41,260 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 81 transitions. [2021-12-22 13:57:41,260 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-22 13:57:41,260 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 81 transitions. [2021-12-22 13:57:41,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-22 13:57:41,261 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:57:41,261 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-22 13:57:41,261 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-22 13:57:41,261 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:57:41,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:57:41,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1966940953, now seen corresponding path program 1 times [2021-12-22 13:57:41,262 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:57:41,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730294302] [2021-12-22 13:57:41,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:57:41,262 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:57:41,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:41,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 13:57:41,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:41,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 13:57:41,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:41,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-22 13:57:41,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:41,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-22 13:57:41,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:41,488 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-22 13:57:41,489 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:57:41,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730294302] [2021-12-22 13:57:41,489 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730294302] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:57:41,489 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:57:41,489 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-22 13:57:41,489 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915735384] [2021-12-22 13:57:41,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:57:41,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-22 13:57:41,490 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:57:41,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-22 13:57:41,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2021-12-22 13:57:41,491 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-22 13:57:41,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:57:41,881 INFO L93 Difference]: Finished difference Result 81 states and 92 transitions. [2021-12-22 13:57:41,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-22 13:57:41,882 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-22 13:57:41,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:57:41,882 INFO L225 Difference]: With dead ends: 81 [2021-12-22 13:57:41,882 INFO L226 Difference]: Without dead ends: 79 [2021-12-22 13:57:41,883 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-22 13:57:41,883 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 66 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 13:57:41,883 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 424 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 13:57:41,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2021-12-22 13:57:41,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 63. [2021-12-22 13:57:41,887 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-22 13:57:41,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2021-12-22 13:57:41,888 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 37 [2021-12-22 13:57:41,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:57:41,888 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2021-12-22 13:57:41,888 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-22 13:57:41,888 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2021-12-22 13:57:41,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-22 13:57:41,889 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:57:41,889 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-22 13:57:41,889 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-22 13:57:41,889 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:57:41,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:57:41,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1038585084, now seen corresponding path program 1 times [2021-12-22 13:57:41,890 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:57:41,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779717582] [2021-12-22 13:57:41,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:57:41,890 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:57:41,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:41,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 13:57:42,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:42,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 13:57:42,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:42,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-22 13:57:42,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:42,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-22 13:57:42,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:42,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-22 13:57:42,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:42,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-22 13:57:42,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:42,059 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-22 13:57:42,060 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:57:42,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779717582] [2021-12-22 13:57:42,060 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779717582] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:57:42,060 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:57:42,060 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 13:57:42,060 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336812855] [2021-12-22 13:57:42,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:57:42,061 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 13:57:42,061 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:57:42,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 13:57:42,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-22 13:57:42,062 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-22 13:57:42,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:57:42,181 INFO L93 Difference]: Finished difference Result 91 states and 102 transitions. [2021-12-22 13:57:42,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 13:57:42,181 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-22 13:57:42,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:57:42,182 INFO L225 Difference]: With dead ends: 91 [2021-12-22 13:57:42,182 INFO L226 Difference]: Without dead ends: 63 [2021-12-22 13:57:42,183 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-22 13:57:42,183 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 49 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 13:57:42,184 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 108 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 13:57:42,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-12-22 13:57:42,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2021-12-22 13:57:42,187 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-22 13:57:42,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2021-12-22 13:57:42,188 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 44 [2021-12-22 13:57:42,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:57:42,188 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2021-12-22 13:57:42,188 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-22 13:57:42,189 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2021-12-22 13:57:42,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-22 13:57:42,189 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:57:42,189 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-22 13:57:42,190 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-22 13:57:42,190 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:57:42,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:57:42,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1442491607, now seen corresponding path program 1 times [2021-12-22 13:57:42,190 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:57:42,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632022403] [2021-12-22 13:57:42,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:57:42,191 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:57:42,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:42,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 13:57:42,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:42,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 13:57:42,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:42,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-22 13:57:42,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:42,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-22 13:57:42,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:42,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-22 13:57:42,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:42,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-22 13:57:42,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:42,367 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-22 13:57:42,367 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:57:42,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632022403] [2021-12-22 13:57:42,367 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632022403] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:57:42,367 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:57:42,367 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-22 13:57:42,368 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718624178] [2021-12-22 13:57:42,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:57:42,368 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-22 13:57:42,368 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:57:42,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-22 13:57:42,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-22 13:57:42,369 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-22 13:57:42,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:57:42,542 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2021-12-22 13:57:42,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-22 13:57:42,542 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-22 13:57:42,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:57:42,543 INFO L225 Difference]: With dead ends: 75 [2021-12-22 13:57:42,543 INFO L226 Difference]: Without dead ends: 73 [2021-12-22 13:57:42,543 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-22 13:57:42,544 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 42 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 13:57:42,544 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 279 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 13:57:42,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-12-22 13:57:42,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2021-12-22 13:57:42,547 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-22 13:57:42,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2021-12-22 13:57:42,548 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 46 [2021-12-22 13:57:42,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:57:42,548 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2021-12-22 13:57:42,548 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-22 13:57:42,549 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2021-12-22 13:57:42,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-12-22 13:57:42,549 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:57:42,549 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-22 13:57:42,550 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-22 13:57:42,550 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:57:42,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:57:42,550 INFO L85 PathProgramCache]: Analyzing trace with hash 979191153, now seen corresponding path program 1 times [2021-12-22 13:57:42,550 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:57:42,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980144170] [2021-12-22 13:57:42,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:57:42,551 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:57:42,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:42,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 13:57:42,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:42,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 13:57:42,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:42,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-22 13:57:42,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:42,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-22 13:57:42,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:42,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-22 13:57:42,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:42,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-22 13:57:42,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:42,840 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-22 13:57:42,840 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:57:42,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980144170] [2021-12-22 13:57:42,840 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980144170] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 13:57:42,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034369229] [2021-12-22 13:57:42,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:57:42,841 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 13:57:42,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 13:57:42,842 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-22 13:57:42,874 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-22 13:57:43,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:43,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 2424 conjuncts, 46 conjunts are in the unsatisfiable core [2021-12-22 13:57:43,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 13:57:43,240 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-22 13:57:43,736 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-22 13:57:43,737 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 13:57:43,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034369229] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 13:57:43,987 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-22 13:57:43,987 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 22 [2021-12-22 13:57:43,987 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658445826] [2021-12-22 13:57:43,987 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-22 13:57:43,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-12-22 13:57:43,988 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:57:43,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-12-22 13:57:43,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2021-12-22 13:57:43,989 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-22 13:57:44,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:57:44,471 INFO L93 Difference]: Finished difference Result 141 states and 160 transitions. [2021-12-22 13:57:44,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-22 13:57:44,472 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-22 13:57:44,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:57:44,473 INFO L225 Difference]: With dead ends: 141 [2021-12-22 13:57:44,473 INFO L226 Difference]: Without dead ends: 111 [2021-12-22 13:57:44,474 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 65 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=175, Invalid=1015, Unknown=0, NotChecked=0, Total=1190 [2021-12-22 13:57:44,474 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 92 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 311 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 13:57:44,474 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 502 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 395 Invalid, 0 Unknown, 311 Unchecked, 0.3s Time] [2021-12-22 13:57:44,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-12-22 13:57:44,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 97. [2021-12-22 13:57:44,480 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-22 13:57:44,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 108 transitions. [2021-12-22 13:57:44,480 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 108 transitions. Word has length 50 [2021-12-22 13:57:44,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:57:44,481 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 108 transitions. [2021-12-22 13:57:44,481 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-22 13:57:44,481 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 108 transitions. [2021-12-22 13:57:44,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-12-22 13:57:44,482 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:57:44,482 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-22 13:57:44,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-22 13:57:44,702 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-22 13:57:44,703 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:57:44,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:57:44,703 INFO L85 PathProgramCache]: Analyzing trace with hash -472877729, now seen corresponding path program 1 times [2021-12-22 13:57:44,703 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:57:44,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430445222] [2021-12-22 13:57:44,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:57:44,703 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:57:44,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:44,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 13:57:44,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:44,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 13:57:44,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:44,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-22 13:57:44,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:44,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-22 13:57:44,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:45,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-22 13:57:45,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:45,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-22 13:57:45,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:45,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-22 13:57:45,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:45,021 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-22 13:57:45,021 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:57:45,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430445222] [2021-12-22 13:57:45,021 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430445222] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:57:45,021 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:57:45,021 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-22 13:57:45,022 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887502411] [2021-12-22 13:57:45,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:57:45,022 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-22 13:57:45,022 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:57:45,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-22 13:57:45,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-22 13:57:45,023 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-22 13:57:45,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:57:45,299 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2021-12-22 13:57:45,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-22 13:57:45,300 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-22 13:57:45,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:57:45,301 INFO L225 Difference]: With dead ends: 103 [2021-12-22 13:57:45,301 INFO L226 Difference]: Without dead ends: 101 [2021-12-22 13:57:45,301 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-22 13:57:45,301 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 49 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 13:57:45,301 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 174 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 13:57:45,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-12-22 13:57:45,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2021-12-22 13:57:45,336 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-22 13:57:45,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2021-12-22 13:57:45,338 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 52 [2021-12-22 13:57:45,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:57:45,340 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2021-12-22 13:57:45,340 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-22 13:57:45,340 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2021-12-22 13:57:45,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-12-22 13:57:45,341 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:57:45,342 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-22 13:57:45,342 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-22 13:57:45,343 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:57:45,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:57:45,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1896049654, now seen corresponding path program 1 times [2021-12-22 13:57:45,344 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:57:45,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730659378] [2021-12-22 13:57:45,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:57:45,345 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:57:45,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:45,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 13:57:45,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:45,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 13:57:45,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:45,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-22 13:57:45,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:45,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-22 13:57:45,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:45,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-22 13:57:45,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:45,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-22 13:57:45,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:45,567 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-22 13:57:45,567 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:57:45,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730659378] [2021-12-22 13:57:45,567 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730659378] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:57:45,568 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:57:45,568 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-22 13:57:45,568 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672605312] [2021-12-22 13:57:45,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:57:45,568 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-22 13:57:45,568 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:57:45,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-22 13:57:45,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-12-22 13:57:45,569 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-22 13:57:45,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:57:45,815 INFO L93 Difference]: Finished difference Result 121 states and 132 transitions. [2021-12-22 13:57:45,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-22 13:57:45,815 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-22 13:57:45,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:57:45,816 INFO L225 Difference]: With dead ends: 121 [2021-12-22 13:57:45,816 INFO L226 Difference]: Without dead ends: 119 [2021-12-22 13:57:45,816 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2021-12-22 13:57:45,817 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 46 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 13:57:45,817 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 350 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 13:57:45,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-12-22 13:57:45,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 109. [2021-12-22 13:57:45,822 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-22 13:57:45,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 120 transitions. [2021-12-22 13:57:45,823 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 120 transitions. Word has length 52 [2021-12-22 13:57:45,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:57:45,823 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 120 transitions. [2021-12-22 13:57:45,825 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-22 13:57:45,825 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 120 transitions. [2021-12-22 13:57:45,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-12-22 13:57:45,826 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:57:45,826 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-22 13:57:45,826 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-22 13:57:45,826 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:57:45,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:57:45,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1697853064, now seen corresponding path program 1 times [2021-12-22 13:57:45,827 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:57:45,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598693000] [2021-12-22 13:57:45,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:57:45,827 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:57:45,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:45,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 13:57:45,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:45,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 13:57:45,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:45,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-22 13:57:45,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:45,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-22 13:57:45,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:45,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-22 13:57:45,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:45,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-22 13:57:45,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:46,080 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-22 13:57:46,081 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:57:46,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598693000] [2021-12-22 13:57:46,081 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598693000] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:57:46,081 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:57:46,081 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-22 13:57:46,081 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671310442] [2021-12-22 13:57:46,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:57:46,082 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-22 13:57:46,082 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:57:46,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-22 13:57:46,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2021-12-22 13:57:46,082 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-22 13:57:46,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:57:46,491 INFO L93 Difference]: Finished difference Result 121 states and 132 transitions. [2021-12-22 13:57:46,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-22 13:57:46,492 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-22 13:57:46,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:57:46,492 INFO L225 Difference]: With dead ends: 121 [2021-12-22 13:57:46,492 INFO L226 Difference]: Without dead ends: 119 [2021-12-22 13:57:46,493 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-22 13:57:46,493 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 63 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 13:57:46,493 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 425 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 13:57:46,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-12-22 13:57:46,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 97. [2021-12-22 13:57:46,499 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-22 13:57:46,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 107 transitions. [2021-12-22 13:57:46,500 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 107 transitions. Word has length 52 [2021-12-22 13:57:46,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:57:46,500 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 107 transitions. [2021-12-22 13:57:46,500 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-22 13:57:46,501 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 107 transitions. [2021-12-22 13:57:46,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-12-22 13:57:46,501 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:57:46,501 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-22 13:57:46,501 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-22 13:57:46,502 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:57:46,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:57:46,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1077690052, now seen corresponding path program 1 times [2021-12-22 13:57:46,502 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:57:46,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101797841] [2021-12-22 13:57:46,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:57:46,503 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:57:46,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:46,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 13:57:46,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:46,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 13:57:46,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:46,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-22 13:57:46,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:46,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-22 13:57:46,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:46,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-22 13:57:46,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:46,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-22 13:57:46,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:46,679 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-22 13:57:46,679 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:57:46,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101797841] [2021-12-22 13:57:46,680 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101797841] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 13:57:46,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115348934] [2021-12-22 13:57:46,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:57:46,680 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 13:57:46,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 13:57:46,704 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-22 13:57:46,705 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-22 13:57:47,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:47,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 2441 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-22 13:57:47,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 13:57:47,181 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-22 13:57:47,181 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 13:57:47,181 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1115348934] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:57:47,182 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-22 13:57:47,182 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2021-12-22 13:57:47,182 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818277205] [2021-12-22 13:57:47,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:57:47,182 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 13:57:47,182 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:57:47,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 13:57:47,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-22 13:57:47,183 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-22 13:57:47,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:57:47,291 INFO L93 Difference]: Finished difference Result 169 states and 185 transitions. [2021-12-22 13:57:47,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 13:57:47,291 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-22 13:57:47,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:57:47,292 INFO L225 Difference]: With dead ends: 169 [2021-12-22 13:57:47,292 INFO L226 Difference]: Without dead ends: 99 [2021-12-22 13:57:47,292 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-22 13:57:47,293 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-22 13:57:47,293 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-22 13:57:47,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-12-22 13:57:47,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2021-12-22 13:57:47,298 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-22 13:57:47,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2021-12-22 13:57:47,298 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 56 [2021-12-22 13:57:47,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:57:47,299 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2021-12-22 13:57:47,299 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-22 13:57:47,299 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2021-12-22 13:57:47,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-12-22 13:57:47,299 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:57:47,299 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-22 13:57:47,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-22 13:57:47,511 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-22 13:57:47,511 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:57:47,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:57:47,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1100322306, now seen corresponding path program 1 times [2021-12-22 13:57:47,512 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:57:47,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401842675] [2021-12-22 13:57:47,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:57:47,512 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:57:47,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:47,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 13:57:47,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:47,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 13:57:47,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:47,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-22 13:57:47,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:47,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-22 13:57:47,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:47,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-22 13:57:47,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:47,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-22 13:57:47,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:47,882 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-22 13:57:47,883 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:57:47,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401842675] [2021-12-22 13:57:47,883 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401842675] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:57:47,883 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:57:47,883 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-22 13:57:47,883 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445937002] [2021-12-22 13:57:47,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:57:47,884 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-22 13:57:47,884 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:57:47,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-22 13:57:47,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2021-12-22 13:57:47,884 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-22 13:57:48,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:57:48,181 INFO L93 Difference]: Finished difference Result 127 states and 135 transitions. [2021-12-22 13:57:48,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-22 13:57:48,181 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-22 13:57:48,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:57:48,182 INFO L225 Difference]: With dead ends: 127 [2021-12-22 13:57:48,182 INFO L226 Difference]: Without dead ends: 93 [2021-12-22 13:57:48,182 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2021-12-22 13:57:48,183 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 77 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 13:57:48,183 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 198 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 13:57:48,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-12-22 13:57:48,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2021-12-22 13:57:48,188 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-22 13:57:48,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 97 transitions. [2021-12-22 13:57:48,189 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 97 transitions. Word has length 56 [2021-12-22 13:57:48,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:57:48,189 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 97 transitions. [2021-12-22 13:57:48,189 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-22 13:57:48,189 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2021-12-22 13:57:48,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-22 13:57:48,190 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:57:48,190 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-22 13:57:48,190 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-22 13:57:48,190 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:57:48,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:57:48,191 INFO L85 PathProgramCache]: Analyzing trace with hash 237359553, now seen corresponding path program 1 times [2021-12-22 13:57:48,191 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:57:48,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235204805] [2021-12-22 13:57:48,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:57:48,191 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:57:48,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:48,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 13:57:48,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:48,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 13:57:48,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:48,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-22 13:57:48,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:48,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-22 13:57:48,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:48,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-22 13:57:48,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:48,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-22 13:57:48,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:48,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-22 13:57:48,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:48,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-22 13:57:48,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:48,489 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-22 13:57:48,489 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:57:48,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235204805] [2021-12-22 13:57:48,489 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235204805] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:57:48,490 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:57:48,490 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-22 13:57:48,490 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802188055] [2021-12-22 13:57:48,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:57:48,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-22 13:57:48,490 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:57:48,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-22 13:57:48,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2021-12-22 13:57:48,491 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-22 13:57:48,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:57:48,774 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2021-12-22 13:57:48,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-22 13:57:48,774 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-22 13:57:48,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:57:48,775 INFO L225 Difference]: With dead ends: 97 [2021-12-22 13:57:48,775 INFO L226 Difference]: Without dead ends: 93 [2021-12-22 13:57:48,775 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-22 13:57:48,776 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 51 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 13:57:48,776 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 218 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 13:57:48,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-12-22 13:57:48,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2021-12-22 13:57:48,799 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-22 13:57:48,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 98 transitions. [2021-12-22 13:57:48,800 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 98 transitions. Word has length 59 [2021-12-22 13:57:48,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:57:48,800 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 98 transitions. [2021-12-22 13:57:48,800 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-22 13:57:48,800 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2021-12-22 13:57:48,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-12-22 13:57:48,801 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:57:48,801 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-22 13:57:48,801 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-22 13:57:48,801 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:57:48,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:57:48,802 INFO L85 PathProgramCache]: Analyzing trace with hash 53156309, now seen corresponding path program 1 times [2021-12-22 13:57:48,802 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:57:48,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365487359] [2021-12-22 13:57:48,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:57:48,802 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:57:48,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:48,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 13:57:48,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:48,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 13:57:48,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:48,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-22 13:57:49,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:49,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-22 13:57:49,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:49,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-22 13:57:49,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:49,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-22 13:57:49,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:49,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-22 13:57:49,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:49,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-22 13:57:49,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:49,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-22 13:57:49,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:49,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-22 13:57:49,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:49,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-22 13:57:49,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:49,102 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-22 13:57:49,102 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:57:49,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365487359] [2021-12-22 13:57:49,103 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365487359] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 13:57:49,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276155611] [2021-12-22 13:57:49,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:57:49,103 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 13:57:49,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 13:57:49,120 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-22 13:57:49,140 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-22 13:57:49,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:49,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 2498 conjuncts, 37 conjunts are in the unsatisfiable core [2021-12-22 13:57:49,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 13:57:49,505 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-22 13:57:50,005 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-22 13:57:50,005 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-22 13:57:50,062 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-22 13:57:50,062 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 13:57:51,271 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [276155611] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 13:57:51,271 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-22 13:57:51,272 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 19 [2021-12-22 13:57:51,272 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055382193] [2021-12-22 13:57:51,272 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-22 13:57:51,272 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-22 13:57:51,272 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:57:51,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-22 13:57:51,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=367, Unknown=1, NotChecked=0, Total=420 [2021-12-22 13:57:51,273 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-22 13:57:51,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:57:51,897 INFO L93 Difference]: Finished difference Result 142 states and 153 transitions. [2021-12-22 13:57:51,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-22 13:57:51,897 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-22 13:57:51,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:57:51,898 INFO L225 Difference]: With dead ends: 142 [2021-12-22 13:57:51,898 INFO L226 Difference]: Without dead ends: 68 [2021-12-22 13:57:51,899 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 130 SyntacticMatches, 10 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=149, Invalid=1182, Unknown=1, NotChecked=0, Total=1332 [2021-12-22 13:57:51,899 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 88 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 206 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 13:57:51,899 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 439 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 525 Invalid, 0 Unknown, 206 Unchecked, 0.3s Time] [2021-12-22 13:57:51,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-12-22 13:57:51,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2021-12-22 13:57:51,903 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-22 13:57:51,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2021-12-22 13:57:51,904 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 76 [2021-12-22 13:57:51,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:57:51,904 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2021-12-22 13:57:51,904 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-22 13:57:51,904 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2021-12-22 13:57:51,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-12-22 13:57:51,905 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 13:57:51,905 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-22 13:57:51,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-22 13:57:52,123 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-22 13:57:52,123 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 13:57:52,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:57:52,124 INFO L85 PathProgramCache]: Analyzing trace with hash 2101457013, now seen corresponding path program 1 times [2021-12-22 13:57:52,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:57:52,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739528605] [2021-12-22 13:57:52,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:57:52,124 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:57:52,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:52,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 13:57:52,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:52,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-22 13:57:52,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:52,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-22 13:57:52,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:52,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-22 13:57:52,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:52,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-22 13:57:52,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:52,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-22 13:57:52,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:52,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-22 13:57:52,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:52,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-22 13:57:52,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:52,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-22 13:57:52,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:52,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-22 13:57:52,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:52,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-22 13:57:52,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:57:52,999 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-22 13:57:52,999 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:57:52,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739528605] [2021-12-22 13:57:52,999 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739528605] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:57:52,999 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:57:52,999 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-22 13:57:53,000 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856206641] [2021-12-22 13:57:53,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:57:53,000 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-22 13:57:53,000 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:57:53,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-22 13:57:53,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2021-12-22 13:57:53,001 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-22 13:57:53,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 13:57:53,321 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2021-12-22 13:57:53,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-22 13:57:53,321 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-22 13:57:53,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 13:57:53,322 INFO L225 Difference]: With dead ends: 68 [2021-12-22 13:57:53,322 INFO L226 Difference]: Without dead ends: 0 [2021-12-22 13:57:53,322 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-22 13:57:53,322 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 46 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 13:57:53,322 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 241 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 13:57:53,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-22 13:57:53,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-22 13:57:53,323 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-22 13:57:53,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-22 13:57:53,323 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 88 [2021-12-22 13:57:53,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 13:57:53,323 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-22 13:57:53,323 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-22 13:57:53,323 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-22 13:57:53,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-22 13:57:53,325 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-22 13:57:53,326 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-22 13:57:53,328 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-22 13:57:54,486 INFO L854 garLoopResultBuilder]: At program point bounded_mallocENTRY(lines 6882 6887) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2021-12-22 13:57:54,486 INFO L858 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6882 6887) no Hoare annotation was computed. [2021-12-22 13:57:54,487 INFO L858 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6882 6887) no Hoare annotation was computed. [2021-12-22 13:57:54,487 INFO L858 garLoopResultBuilder]: For program point L6883-1(lines 6883 6885) no Hoare annotation was computed. [2021-12-22 13:57:54,487 INFO L854 garLoopResultBuilder]: At program point L6883(lines 6883 6885) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2021-12-22 13:57:54,487 INFO L858 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2021-12-22 13:57:54,487 INFO L861 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2021-12-22 13:57:54,487 INFO L858 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-12-22 13:57:54,487 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2021-12-22 13:57:54,487 INFO L858 garLoopResultBuilder]: For program point L7387(line 7387) no Hoare annotation was computed. [2021-12-22 13:57:54,487 INFO L858 garLoopResultBuilder]: For program point L7387-5(line 7387) no Hoare annotation was computed. [2021-12-22 13:57:54,487 INFO L858 garLoopResultBuilder]: For program point L7387-4(line 7387) no Hoare annotation was computed. [2021-12-22 13:57:54,487 INFO L858 garLoopResultBuilder]: For program point L7387-2(line 7387) no Hoare annotation was computed. [2021-12-22 13:57:54,487 INFO L861 garLoopResultBuilder]: At program point aws_byte_cursor_is_validENTRY(lines 7384 7388) the Hoare annotation is: true [2021-12-22 13:57:54,487 INFO L858 garLoopResultBuilder]: For program point L7387-8(line 7387) no Hoare annotation was computed. [2021-12-22 13:57:54,487 INFO L858 garLoopResultBuilder]: For program point L7387-6(line 7387) no Hoare annotation was computed. [2021-12-22 13:57:54,487 INFO L858 garLoopResultBuilder]: For program point L7387-11(line 7387) no Hoare annotation was computed. [2021-12-22 13:57:54,487 INFO L858 garLoopResultBuilder]: For program point L7387-10(line 7387) no Hoare annotation was computed. [2021-12-22 13:57:54,487 INFO L858 garLoopResultBuilder]: For program point aws_byte_cursor_is_validEXIT(lines 7384 7388) no Hoare annotation was computed. [2021-12-22 13:57:54,487 INFO L858 garLoopResultBuilder]: For program point L7386(lines 7386 7387) no Hoare annotation was computed. [2021-12-22 13:57:54,487 INFO L858 garLoopResultBuilder]: For program point L7386-2(lines 7386 7387) no Hoare annotation was computed. [2021-12-22 13:57:54,487 INFO L858 garLoopResultBuilder]: For program point aws_byte_cursor_is_validFINAL(lines 7384 7388) no Hoare annotation was computed. [2021-12-22 13:57:54,488 INFO L858 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2021-12-22 13:57:54,488 INFO L861 garLoopResultBuilder]: At program point nondet_uint64_tENTRY(line 266) the Hoare annotation is: true [2021-12-22 13:57:54,488 INFO L858 garLoopResultBuilder]: For program point nondet_uint64_tFINAL(line 266) no Hoare annotation was computed. [2021-12-22 13:57:54,488 INFO L858 garLoopResultBuilder]: For program point L8256-2(line 8256) no Hoare annotation was computed. [2021-12-22 13:57:54,488 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-22 13:57:54,488 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-22 13:57:54,488 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-22 13:57:54,488 INFO L858 garLoopResultBuilder]: For program point L7106-1(line 7106) no Hoare annotation was computed. [2021-12-22 13:57:54,488 INFO L858 garLoopResultBuilder]: For program point L8962-1(line 8962) no Hoare annotation was computed. [2021-12-22 13:57:54,488 INFO L858 garLoopResultBuilder]: For program point L8252-1(line 8252) no Hoare annotation was computed. [2021-12-22 13:57:54,488 INFO L858 garLoopResultBuilder]: For program point L7100-1(lines 7099 7112) no Hoare annotation was computed. [2021-12-22 13:57:54,488 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-22 13:57:54,488 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-22 13:57:54,488 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-22 13:57:54,489 INFO L858 garLoopResultBuilder]: For program point L7107-1(lines 7107 7109) no Hoare annotation was computed. [2021-12-22 13:57:54,489 INFO L858 garLoopResultBuilder]: For program point L8969-1(line 8969) no Hoare annotation was computed. [2021-12-22 13:57:54,489 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-22 13:57:54,489 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-22 13:57:54,489 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-22 13:57:54,489 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-22 13:57:54,489 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-22 13:57:54,489 INFO L858 garLoopResultBuilder]: For program point L7099(lines 7099 7112) no Hoare annotation was computed. [2021-12-22 13:57:54,489 INFO L858 garLoopResultBuilder]: For program point L8959(lines 8959 8973) no Hoare annotation was computed. [2021-12-22 13:57:54,489 INFO L858 garLoopResultBuilder]: For program point L8970(lines 8970 8972) no Hoare annotation was computed. [2021-12-22 13:57:54,489 INFO L861 garLoopResultBuilder]: At program point L8974(line 8974) the Hoare annotation is: true [2021-12-22 13:57:54,489 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-22 13:57:54,489 INFO L861 garLoopResultBuilder]: At program point L8962(line 8962) the Hoare annotation is: true [2021-12-22 13:57:54,489 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-22 13:57:54,489 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-22 13:57:54,489 INFO L858 garLoopResultBuilder]: For program point L8970-2(lines 8970 8972) no Hoare annotation was computed. [2021-12-22 13:57:54,490 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-22 13:57:54,490 INFO L858 garLoopResultBuilder]: For program point L8968-2(line 8968) no Hoare annotation was computed. [2021-12-22 13:57:54,490 INFO L858 garLoopResultBuilder]: For program point L7110-1(line 7110) no Hoare annotation was computed. [2021-12-22 13:57:54,490 INFO L858 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-12-22 13:57:54,490 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2021-12-22 13:57:54,490 INFO L858 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-12-22 13:57:54,490 INFO L858 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2021-12-22 13:57:54,490 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2021-12-22 13:57:54,490 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-12-22 13:57:54,492 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-22 13:57:54,494 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-22 13:57:54,501 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-22 13:57:54,502 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-22 13:57:54,502 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-22 13:57:54,502 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-22 13:57:54,503 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-22 13:57:54,503 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-22 13:57:54,505 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-22 13:57:54,505 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-22 13:57:54,505 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-22 13:57:54,505 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-22 13:57:54,506 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-22 13:57:54,506 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-22 13:57:54,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 01:57:54 BoogieIcfgContainer [2021-12-22 13:57:54,507 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-22 13:57:54,507 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-22 13:57:54,507 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-22 13:57:54,508 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-22 13:57:54,523 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 01:57:38" (3/4) ... [2021-12-22 13:57:54,525 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-22 13:57:54,529 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2021-12-22 13:57:54,529 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_byte_cursor_is_valid [2021-12-22 13:57:54,529 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2021-12-22 13:57:54,530 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2021-12-22 13:57:54,530 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2021-12-22 13:57:54,537 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 117 nodes and edges [2021-12-22 13:57:54,538 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 55 nodes and edges [2021-12-22 13:57:54,546 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2021-12-22 13:57:54,547 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2021-12-22 13:57:54,547 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2021-12-22 13:57:54,548 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-12-22 13:57:54,549 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-12-22 13:57:54,549 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-22 13:57:54,583 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-22 13:57:55,242 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-22 13:57:55,242 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-22 13:57:55,243 INFO L158 Benchmark]: Toolchain (without parser) took 19824.20ms. Allocated memory was 134.2MB in the beginning and 469.8MB in the end (delta: 335.5MB). Free memory was 98.6MB in the beginning and 282.7MB in the end (delta: -184.1MB). Peak memory consumption was 318.5MB. Max. memory is 16.1GB. [2021-12-22 13:57:55,243 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 96.5MB. Free memory is still 58.2MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-22 13:57:55,243 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1584.11ms. Allocated memory was 134.2MB in the beginning and 188.7MB in the end (delta: 54.5MB). Free memory was 98.3MB in the beginning and 118.3MB in the end (delta: -20.0MB). Peak memory consumption was 67.7MB. Max. memory is 16.1GB. [2021-12-22 13:57:55,244 INFO L158 Benchmark]: Boogie Procedure Inliner took 175.01ms. Allocated memory is still 188.7MB. Free memory was 118.3MB in the beginning and 106.8MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-22 13:57:55,244 INFO L158 Benchmark]: Boogie Preprocessor took 46.50ms. Allocated memory is still 188.7MB. Free memory was 106.8MB in the beginning and 100.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-22 13:57:55,244 INFO L158 Benchmark]: RCFGBuilder took 974.66ms. Allocated memory is still 188.7MB. Free memory was 100.5MB in the beginning and 104.7MB in the end (delta: -4.2MB). Peak memory consumption was 49.2MB. Max. memory is 16.1GB. [2021-12-22 13:57:55,244 INFO L158 Benchmark]: TraceAbstraction took 16303.27ms. Allocated memory was 188.7MB in the beginning and 469.8MB in the end (delta: 281.0MB). Free memory was 104.7MB in the beginning and 270.3MB in the end (delta: -165.5MB). Peak memory consumption was 115.5MB. Max. memory is 16.1GB. [2021-12-22 13:57:55,244 INFO L158 Benchmark]: Witness Printer took 735.27ms. Allocated memory is still 469.8MB. Free memory was 269.2MB in the beginning and 282.7MB in the end (delta: -13.5MB). Peak memory consumption was 155.4MB. Max. memory is 16.1GB. [2021-12-22 13:57:55,245 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 96.5MB. Free memory is still 58.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1584.11ms. Allocated memory was 134.2MB in the beginning and 188.7MB in the end (delta: 54.5MB). Free memory was 98.3MB in the beginning and 118.3MB in the end (delta: -20.0MB). Peak memory consumption was 67.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 175.01ms. Allocated memory is still 188.7MB. Free memory was 118.3MB in the beginning and 106.8MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.50ms. Allocated memory is still 188.7MB. Free memory was 106.8MB in the beginning and 100.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 974.66ms. Allocated memory is still 188.7MB. Free memory was 100.5MB in the beginning and 104.7MB in the end (delta: -4.2MB). Peak memory consumption was 49.2MB. Max. memory is 16.1GB. * TraceAbstraction took 16303.27ms. Allocated memory was 188.7MB in the beginning and 469.8MB in the end (delta: 281.0MB). Free memory was 104.7MB in the beginning and 270.3MB in the end (delta: -165.5MB). Peak memory consumption was 115.5MB. Max. memory is 16.1GB. * Witness Printer took 735.27ms. Allocated memory is still 469.8MB. Free memory was 269.2MB in the beginning and 282.7MB in the end (delta: -13.5MB). Peak memory consumption was 155.4MB. 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: 16.2s, OverallIterations: 18, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1026 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 973 mSDsluCounter, 4815 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 534 IncrementalHoareTripleChecker+Unchecked, 3765 mSDsCounter, 388 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4719 IncrementalHoareTripleChecker+Invalid, 5641 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 388 mSolverCounterUnsat, 1050 mSDtfsCounter, 4719 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 762 GetRequests, 465 SyntacticMatches, 16 SemanticMatches, 281 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 810 ImplicationChecksByTransitivity, 4.2s 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.2s 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.4s SatisfiabilityAnalysisTime, 5.9s 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-22 13:57:55,251 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-22 13:57:55,251 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-22 13:57:55,251 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-22 13:57:55,251 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-22 13:57:55,251 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-22 13:57:55,252 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-22 13:57:55,252 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-22 13:57:55,252 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-22 13:57:55,253 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-22 13:57:55,253 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-22 13:57:55,253 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-22 13:57:55,253 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-22 13:57:55,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE