./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_cursor_eq_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c 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_eq_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 376fa3967c5a16dbeae94f1517cf176a2f53d2660c6b5c3d2eeb4fd9f827337c --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 11:01:16,429 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 11:01:16,430 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 11:01:16,447 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 11:01:16,448 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 11:01:16,448 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 11:01:16,449 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 11:01:16,451 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 11:01:16,452 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 11:01:16,452 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 11:01:16,453 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 11:01:16,454 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 11:01:16,454 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 11:01:16,455 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 11:01:16,455 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 11:01:16,456 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 11:01:16,457 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 11:01:16,457 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 11:01:16,458 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 11:01:16,459 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 11:01:16,460 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 11:01:16,461 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 11:01:16,462 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 11:01:16,462 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 11:01:16,463 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 11:01:16,465 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 11:01:16,465 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 11:01:16,465 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 11:01:16,466 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 11:01:16,466 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 11:01:16,467 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 11:01:16,467 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 11:01:16,467 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 11:01:16,468 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 11:01:16,468 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 11:01:16,469 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 11:01:16,469 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 11:01:16,470 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 11:01:16,470 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 11:01:16,470 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 11:01:16,471 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 11:01:16,472 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 11:01:16,473 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-12 11:01:16,487 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 11:01:16,487 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 11:01:16,488 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 11:01:16,488 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 11:01:16,488 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 11:01:16,489 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 11:01:16,489 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 11:01:16,489 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 11:01:16,489 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 11:01:16,489 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 11:01:16,490 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 11:01:16,490 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 11:01:16,490 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 11:01:16,490 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 11:01:16,490 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 11:01:16,490 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 11:01:16,490 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 11:01:16,491 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 11:01:16,491 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 11:01:16,491 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 11:01:16,491 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 11:01:16,491 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 11:01:16,491 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 11:01:16,492 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 11:01:16,492 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 11:01:16,492 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 11:01:16,492 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 11:01:16,492 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 11:01:16,492 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 11:01:16,493 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 11:01:16,493 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 -> 376fa3967c5a16dbeae94f1517cf176a2f53d2660c6b5c3d2eeb4fd9f827337c [2022-07-12 11:01:16,666 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 11:01:16,684 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 11:01:16,686 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 11:01:16,687 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 11:01:16,688 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 11:01:16,689 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_eq_harness.i [2022-07-12 11:01:16,747 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccee332eb/6a6272a4f8b344ca95e51d04776b5465/FLAG40df8207e [2022-07-12 11:01:17,335 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 11:01:17,336 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_eq_harness.i [2022-07-12 11:01:17,361 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccee332eb/6a6272a4f8b344ca95e51d04776b5465/FLAG40df8207e [2022-07-12 11:01:17,542 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccee332eb/6a6272a4f8b344ca95e51d04776b5465 [2022-07-12 11:01:17,546 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 11:01:17,547 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 11:01:17,548 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 11:01:17,548 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 11:01:17,550 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 11:01:17,550 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 11:01:17" (1/1) ... [2022-07-12 11:01:17,551 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c4666c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:01:17, skipping insertion in model container [2022-07-12 11:01:17,552 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 11:01:17" (1/1) ... [2022-07-12 11:01:17,556 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 11:01:17,627 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 11:01:17,817 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_eq_harness.i[4492,4505] [2022-07-12 11:01:17,822 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_eq_harness.i[4552,4565] [2022-07-12 11:01:18,316 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:01:18,318 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:01:18,319 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:01:18,319 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:01:18,320 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:01:18,328 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:01:18,331 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:01:18,333 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:01:18,333 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:01:18,543 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-12 11:01:18,544 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-12 11:01:18,545 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-12 11:01:18,545 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-12 11:01:18,546 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-12 11:01:18,547 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-12 11:01:18,547 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-12 11:01:18,547 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-12 11:01:18,548 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-12 11:01:18,548 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-12 11:01:18,642 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-12 11:01:18,775 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:01:18,775 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:01:18,823 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 11:01:18,862 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 11:01:18,883 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_eq_harness.i[4492,4505] [2022-07-12 11:01:18,884 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_eq_harness.i[4552,4565] [2022-07-12 11:01:18,914 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:01:18,914 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:01:18,915 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:01:18,915 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:01:18,916 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:01:18,920 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:01:18,921 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:01:18,921 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:01:18,921 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:01:18,947 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-12 11:01:18,948 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-12 11:01:18,948 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-12 11:01:18,949 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-12 11:01:18,949 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-12 11:01:18,950 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-12 11:01:18,950 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-12 11:01:18,950 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-12 11:01:18,950 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-12 11:01:18,952 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-12 11:01:18,971 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-12 11:01:19,047 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:01:19,048 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:01:19,067 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 11:01:19,205 INFO L208 MainTranslator]: Completed translation [2022-07-12 11:01:19,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:01:19 WrapperNode [2022-07-12 11:01:19,206 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 11:01:19,207 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 11:01:19,207 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 11:01:19,207 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 11:01:19,211 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:01:19" (1/1) ... [2022-07-12 11:01:19,277 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:01:19" (1/1) ... [2022-07-12 11:01:19,333 INFO L137 Inliner]: procedures = 691, calls = 2650, calls flagged for inlining = 60, calls inlined = 6, statements flattened = 873 [2022-07-12 11:01:19,334 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 11:01:19,334 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 11:01:19,334 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 11:01:19,334 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 11:01:19,345 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:01:19" (1/1) ... [2022-07-12 11:01:19,345 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:01:19" (1/1) ... [2022-07-12 11:01:19,355 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:01:19" (1/1) ... [2022-07-12 11:01:19,355 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:01:19" (1/1) ... [2022-07-12 11:01:19,381 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:01:19" (1/1) ... [2022-07-12 11:01:19,383 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:01:19" (1/1) ... [2022-07-12 11:01:19,395 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:01:19" (1/1) ... [2022-07-12 11:01:19,402 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 11:01:19,403 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 11:01:19,403 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 11:01:19,403 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 11:01:19,404 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:01:19" (1/1) ... [2022-07-12 11:01:19,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 11:01:19,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:01:19,428 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) [2022-07-12 11:01:19,434 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 [2022-07-12 11:01:19,464 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_is_valid [2022-07-12 11:01:19,465 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_is_valid [2022-07-12 11:01:19,465 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-07-12 11:01:19,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 11:01:19,465 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-07-12 11:01:19,465 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-07-12 11:01:19,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 11:01:19,466 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_is_bounded [2022-07-12 11:01:19,466 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_is_bounded [2022-07-12 11:01:19,466 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-12 11:01:19,466 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-12 11:01:19,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 11:01:19,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 11:01:19,467 INFO L130 BoogieDeclarations]: Found specification of procedure save_byte_from_array [2022-07-12 11:01:19,468 INFO L138 BoogieDeclarations]: Found implementation of procedure save_byte_from_array [2022-07-12 11:01:19,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 11:01:19,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 11:01:19,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 11:01:19,468 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-07-12 11:01:19,468 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-07-12 11:01:19,468 INFO L130 BoogieDeclarations]: Found specification of procedure assert_byte_from_buffer_matches [2022-07-12 11:01:19,468 INFO L138 BoogieDeclarations]: Found implementation of procedure assert_byte_from_buffer_matches [2022-07-12 11:01:19,468 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-12 11:01:19,468 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-12 11:01:19,469 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 11:01:19,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 11:01:19,469 INFO L130 BoogieDeclarations]: Found specification of procedure aws_array_eq [2022-07-12 11:01:19,469 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_array_eq [2022-07-12 11:01:19,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 11:01:19,470 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-07-12 11:01:19,470 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-07-12 11:01:19,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 11:01:19,470 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_byte_cursor_has_allocated_buffer_member [2022-07-12 11:01:19,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_byte_cursor_has_allocated_buffer_member [2022-07-12 11:01:19,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 11:01:19,673 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 11:01:19,675 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 11:01:20,318 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 11:01:20,325 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 11:01:20,325 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-12 11:01:20,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 11:01:20 BoogieIcfgContainer [2022-07-12 11:01:20,327 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 11:01:20,329 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 11:01:20,329 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 11:01:20,332 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 11:01:20,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 11:01:17" (1/3) ... [2022-07-12 11:01:20,333 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5031f94f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 11:01:20, skipping insertion in model container [2022-07-12 11:01:20,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:01:19" (2/3) ... [2022-07-12 11:01:20,333 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5031f94f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 11:01:20, skipping insertion in model container [2022-07-12 11:01:20,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 11:01:20" (3/3) ... [2022-07-12 11:01:20,334 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_cursor_eq_harness.i [2022-07-12 11:01:20,348 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 11:01:20,348 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 11:01:20,398 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 11:01:20,413 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@71ac20da, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@c928eed [2022-07-12 11:01:20,413 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 11:01:20,417 INFO L276 IsEmpty]: Start isEmpty. Operand has 134 states, 81 states have (on average 1.2345679012345678) internal successors, (100), 82 states have internal predecessors, (100), 40 states have call successors, (40), 11 states have call predecessors, (40), 11 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2022-07-12 11:01:20,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-07-12 11:01:20,430 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:01:20,430 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:01:20,430 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:01:20,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:01:20,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1846687754, now seen corresponding path program 1 times [2022-07-12 11:01:20,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:01:20,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956744158] [2022-07-12 11:01:20,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:20,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:01:20,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:20,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:01:20,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:20,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:01:20,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:20,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:01:20,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:20,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:01:20,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:20,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:01:20,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:20,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 11:01:20,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:20,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 11:01:20,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:20,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 11:01:20,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:20,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 11:01:20,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:20,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 11:01:20,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:20,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 11:01:20,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:20,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 11:01:20,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:21,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 11:01:21,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:21,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 11:01:21,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:21,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:01:21,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:21,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:01:21,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:21,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 11:01:21,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:21,054 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2022-07-12 11:01:21,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:01:21,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956744158] [2022-07-12 11:01:21,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956744158] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:01:21,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:01:21,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 11:01:21,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488758214] [2022-07-12 11:01:21,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:01:21,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 11:01:21,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:01:21,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 11:01:21,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 11:01:21,088 INFO L87 Difference]: Start difference. First operand has 134 states, 81 states have (on average 1.2345679012345678) internal successors, (100), 82 states have internal predecessors, (100), 40 states have call successors, (40), 11 states have call predecessors, (40), 11 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (18), 4 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-12 11:01:21,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:01:21,398 INFO L93 Difference]: Finished difference Result 267 states and 385 transitions. [2022-07-12 11:01:21,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 11:01:21,400 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (18), 4 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 102 [2022-07-12 11:01:21,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:01:21,407 INFO L225 Difference]: With dead ends: 267 [2022-07-12 11:01:21,407 INFO L226 Difference]: Without dead ends: 131 [2022-07-12 11:01:21,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 11:01:21,412 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 102 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 11:01:21,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 196 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 11:01:21,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-07-12 11:01:21,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 128. [2022-07-12 11:01:21,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 76 states have (on average 1.2105263157894737) internal successors, (92), 77 states have internal predecessors, (92), 40 states have call successors, (40), 11 states have call predecessors, (40), 11 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2022-07-12 11:01:21,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 171 transitions. [2022-07-12 11:01:21,446 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 171 transitions. Word has length 102 [2022-07-12 11:01:21,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:01:21,447 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 171 transitions. [2022-07-12 11:01:21,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (18), 4 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-12 11:01:21,447 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 171 transitions. [2022-07-12 11:01:21,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-07-12 11:01:21,451 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:01:21,451 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:01:21,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 11:01:21,452 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:01:21,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:01:21,453 INFO L85 PathProgramCache]: Analyzing trace with hash -192509010, now seen corresponding path program 1 times [2022-07-12 11:01:21,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:01:21,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514364267] [2022-07-12 11:01:21,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:21,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:01:21,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:21,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:01:21,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:21,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:01:21,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:21,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:01:21,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:21,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:01:21,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:21,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:01:21,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:21,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 11:01:21,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:21,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 11:01:21,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:21,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 11:01:21,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:21,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 11:01:21,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:21,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 11:01:21,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:21,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 11:01:21,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:21,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 11:01:21,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:21,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 11:01:21,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:21,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 11:01:21,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:21,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:01:21,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:21,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:01:21,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:21,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 11:01:21,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:21,826 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-07-12 11:01:21,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:01:21,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514364267] [2022-07-12 11:01:21,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514364267] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:01:21,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178409860] [2022-07-12 11:01:21,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:21,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:01:21,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:01:21,828 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) [2022-07-12 11:01:21,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 11:01:22,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:22,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 2662 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 11:01:22,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:01:22,410 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-07-12 11:01:22,410 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:01:22,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178409860] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:01:22,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:01:22,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2022-07-12 11:01:22,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788894204] [2022-07-12 11:01:22,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:01:22,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 11:01:22,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:01:22,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 11:01:22,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-07-12 11:01:22,416 INFO L87 Difference]: Start difference. First operand 128 states and 171 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-07-12 11:01:22,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:01:22,601 INFO L93 Difference]: Finished difference Result 252 states and 341 transitions. [2022-07-12 11:01:22,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 11:01:22,602 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 102 [2022-07-12 11:01:22,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:01:22,606 INFO L225 Difference]: With dead ends: 252 [2022-07-12 11:01:22,606 INFO L226 Difference]: Without dead ends: 131 [2022-07-12 11:01:22,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-07-12 11:01:22,610 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 186 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:01:22,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 337 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 11:01:22,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-07-12 11:01:22,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2022-07-12 11:01:22,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 78 states have (on average 1.205128205128205) internal successors, (94), 80 states have internal predecessors, (94), 40 states have call successors, (40), 11 states have call predecessors, (40), 12 states have return successors, (45), 39 states have call predecessors, (45), 39 states have call successors, (45) [2022-07-12 11:01:22,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 179 transitions. [2022-07-12 11:01:22,626 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 179 transitions. Word has length 102 [2022-07-12 11:01:22,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:01:22,627 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 179 transitions. [2022-07-12 11:01:22,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-07-12 11:01:22,627 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 179 transitions. [2022-07-12 11:01:22,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-07-12 11:01:22,628 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:01:22,628 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:01:22,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 11:01:22,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:01:22,832 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:01:22,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:01:22,833 INFO L85 PathProgramCache]: Analyzing trace with hash -49851437, now seen corresponding path program 1 times [2022-07-12 11:01:22,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:01:22,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452049910] [2022-07-12 11:01:22,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:22,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:01:22,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:22,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:01:22,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:22,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:01:22,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:22,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:01:22,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:22,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:01:22,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:23,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:01:23,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:23,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 11:01:23,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:23,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:01:23,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:23,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:01:23,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:23,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 11:01:23,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:23,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 11:01:23,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:23,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 11:01:23,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:23,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 11:01:23,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:23,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 11:01:23,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:23,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 11:01:23,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:23,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:01:23,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:23,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:01:23,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:23,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 11:01:23,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:23,157 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-07-12 11:01:23,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:01:23,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452049910] [2022-07-12 11:01:23,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452049910] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:01:23,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780615128] [2022-07-12 11:01:23,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:23,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:01:23,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:01:23,160 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) [2022-07-12 11:01:23,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 11:01:23,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:23,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 2667 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 11:01:23,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:01:23,635 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-07-12 11:01:23,635 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:01:23,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780615128] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:01:23,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:01:23,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2022-07-12 11:01:23,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861755812] [2022-07-12 11:01:23,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:01:23,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 11:01:23,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:01:23,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 11:01:23,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2022-07-12 11:01:23,637 INFO L87 Difference]: Start difference. First operand 131 states and 179 transitions. Second operand has 7 states, 6 states have (on average 8.0) internal successors, (48), 7 states have internal predecessors, (48), 4 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2022-07-12 11:01:23,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:01:23,868 INFO L93 Difference]: Finished difference Result 212 states and 290 transitions. [2022-07-12 11:01:23,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 11:01:23,869 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 7 states have internal predecessors, (48), 4 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 104 [2022-07-12 11:01:23,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:01:23,870 INFO L225 Difference]: With dead ends: 212 [2022-07-12 11:01:23,870 INFO L226 Difference]: Without dead ends: 131 [2022-07-12 11:01:23,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2022-07-12 11:01:23,872 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 206 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 11:01:23,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 537 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 11:01:23,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-07-12 11:01:23,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2022-07-12 11:01:23,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 78 states have (on average 1.205128205128205) internal successors, (94), 80 states have internal predecessors, (94), 40 states have call successors, (40), 11 states have call predecessors, (40), 12 states have return successors, (43), 39 states have call predecessors, (43), 39 states have call successors, (43) [2022-07-12 11:01:23,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 177 transitions. [2022-07-12 11:01:23,880 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 177 transitions. Word has length 104 [2022-07-12 11:01:23,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:01:23,880 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 177 transitions. [2022-07-12 11:01:23,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 7 states have internal predecessors, (48), 4 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2022-07-12 11:01:23,881 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 177 transitions. [2022-07-12 11:01:23,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-12 11:01:23,881 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:01:23,882 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:01:23,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 11:01:24,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-07-12 11:01:24,107 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:01:24,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:01:24,108 INFO L85 PathProgramCache]: Analyzing trace with hash 160212765, now seen corresponding path program 2 times [2022-07-12 11:01:24,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:01:24,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138269910] [2022-07-12 11:01:24,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:24,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:01:24,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:24,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:01:24,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:24,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:01:24,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:24,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:01:24,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:24,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:01:24,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:24,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:01:24,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:24,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 11:01:24,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:24,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:01:24,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:24,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:01:24,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:24,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 11:01:24,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:24,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 11:01:24,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:24,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 11:01:24,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:24,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 11:01:24,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:24,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 11:01:24,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:24,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 11:01:24,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:24,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:01:24,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:24,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:01:24,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:24,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 11:01:24,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:24,343 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-07-12 11:01:24,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:01:24,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138269910] [2022-07-12 11:01:24,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138269910] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:01:24,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547333234] [2022-07-12 11:01:24,343 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 11:01:24,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:01:24,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:01:24,345 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) [2022-07-12 11:01:24,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 11:01:24,670 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-12 11:01:24,671 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 11:01:24,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 2314 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-12 11:01:24,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:01:24,733 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2022-07-12 11:01:24,733 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:01:24,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547333234] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:01:24,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:01:24,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2022-07-12 11:01:24,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325682938] [2022-07-12 11:01:24,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:01:24,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 11:01:24,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:01:24,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 11:01:24,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-07-12 11:01:24,734 INFO L87 Difference]: Start difference. First operand 131 states and 177 transitions. Second operand has 8 states, 7 states have (on average 6.0) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2022-07-12 11:01:24,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:01:24,820 INFO L93 Difference]: Finished difference Result 143 states and 196 transitions. [2022-07-12 11:01:24,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 11:01:24,821 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.0) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) Word has length 108 [2022-07-12 11:01:24,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:01:24,823 INFO L225 Difference]: With dead ends: 143 [2022-07-12 11:01:24,823 INFO L226 Difference]: Without dead ends: 141 [2022-07-12 11:01:24,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2022-07-12 11:01:24,824 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 16 mSDsluCounter, 993 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1166 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:01:24,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1166 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 11:01:24,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-07-12 11:01:24,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 140. [2022-07-12 11:01:24,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 84 states have (on average 1.1904761904761905) internal successors, (100), 87 states have internal predecessors, (100), 41 states have call successors, (41), 12 states have call predecessors, (41), 14 states have return successors, (52), 40 states have call predecessors, (52), 40 states have call successors, (52) [2022-07-12 11:01:24,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 193 transitions. [2022-07-12 11:01:24,840 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 193 transitions. Word has length 108 [2022-07-12 11:01:24,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:01:24,840 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 193 transitions. [2022-07-12 11:01:24,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.0) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2022-07-12 11:01:24,841 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 193 transitions. [2022-07-12 11:01:24,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-07-12 11:01:24,842 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:01:24,842 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:01:24,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 11:01:25,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:01:25,060 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:01:25,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:01:25,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1574940187, now seen corresponding path program 1 times [2022-07-12 11:01:25,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:01:25,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921771053] [2022-07-12 11:01:25,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:25,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:01:25,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:25,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:01:25,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:25,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:01:25,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:25,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:01:25,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:25,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:01:25,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:25,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:01:25,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:25,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 11:01:25,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:25,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:01:25,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:25,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:01:25,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:25,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 11:01:25,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:25,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 11:01:25,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:25,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 11:01:25,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:25,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 11:01:25,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:25,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 11:01:25,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:25,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 11:01:25,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:25,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:01:25,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:25,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:01:25,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:25,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 11:01:25,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:25,382 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-07-12 11:01:25,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:01:25,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921771053] [2022-07-12 11:01:25,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921771053] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:01:25,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678227663] [2022-07-12 11:01:25,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:25,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:01:25,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:01:25,384 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:01:25,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 11:01:25,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:25,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 2689 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 11:01:25,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:01:25,846 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-07-12 11:01:25,846 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:01:25,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [678227663] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:01:25,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:01:25,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2022-07-12 11:01:25,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650000327] [2022-07-12 11:01:25,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:01:25,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 11:01:25,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:01:25,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 11:01:25,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-07-12 11:01:25,848 INFO L87 Difference]: Start difference. First operand 140 states and 193 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 4 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-07-12 11:01:26,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:01:26,052 INFO L93 Difference]: Finished difference Result 245 states and 337 transitions. [2022-07-12 11:01:26,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 11:01:26,052 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 4 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) Word has length 112 [2022-07-12 11:01:26,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:01:26,056 INFO L225 Difference]: With dead ends: 245 [2022-07-12 11:01:26,056 INFO L226 Difference]: Without dead ends: 137 [2022-07-12 11:01:26,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2022-07-12 11:01:26,058 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 205 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 11:01:26,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 540 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 11:01:26,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-07-12 11:01:26,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2022-07-12 11:01:26,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 82 states have (on average 1.1829268292682926) internal successors, (97), 84 states have internal predecessors, (97), 41 states have call successors, (41), 12 states have call predecessors, (41), 13 states have return successors, (48), 40 states have call predecessors, (48), 40 states have call successors, (48) [2022-07-12 11:01:26,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 186 transitions. [2022-07-12 11:01:26,069 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 186 transitions. Word has length 112 [2022-07-12 11:01:26,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:01:26,070 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 186 transitions. [2022-07-12 11:01:26,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 4 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-07-12 11:01:26,070 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 186 transitions. [2022-07-12 11:01:26,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-12 11:01:26,071 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:01:26,071 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:01:26,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 11:01:26,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:01:26,287 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:01:26,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:01:26,288 INFO L85 PathProgramCache]: Analyzing trace with hash 660367434, now seen corresponding path program 1 times [2022-07-12 11:01:26,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:01:26,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988162] [2022-07-12 11:01:26,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:26,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:01:26,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:26,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:01:26,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:26,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:01:26,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:26,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:01:26,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:26,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:01:26,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:26,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:01:26,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:26,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 11:01:26,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:26,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:01:26,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:26,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:01:26,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:26,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 11:01:26,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:26,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 11:01:26,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:26,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 11:01:26,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:26,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 11:01:26,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:26,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 11:01:26,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:26,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 11:01:26,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:26,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:01:26,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:26,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:01:26,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:26,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-12 11:01:26,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:26,772 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 18 proven. 11 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-07-12 11:01:26,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:01:26,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988162] [2022-07-12 11:01:26,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988162] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:01:26,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972357272] [2022-07-12 11:01:26,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:01:26,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:01:26,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:01:26,773 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:01:26,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 11:01:27,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:01:27,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 2694 conjuncts, 129 conjunts are in the unsatisfiable core [2022-07-12 11:01:27,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:01:27,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:01:27,532 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-12 11:01:27,533 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 29 [2022-07-12 11:01:28,304 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-12 11:01:28,305 INFO L390 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 35 treesize of output 15 [2022-07-12 11:01:28,308 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-07-12 11:01:28,310 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-07-12 11:01:28,531 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 28 proven. 68 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-12 11:01:28,531 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:01:53,479 WARN L233 SmtUtils]: Spent 12.96s on a formula simplification that was a NOOP. DAG size: 93 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 11:01:57,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 52 [2022-07-12 11:01:57,837 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 40 [2022-07-12 11:01:59,710 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_401 Int) (|ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base| Int)) (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base|) |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.offset|))) (let ((.cse0 (mod (select (select (store |c_#memory_int| |ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base| (store (store (select |c_#memory_int| |ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base|) |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.offset| .cse1) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.offset|) v_ArrVal_401)) |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base|) |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.offset|) 18446744073709551616))) (or (< 0 .cse0) (= .cse0 (mod .cse1 18446744073709551616)))))) (or (forall ((v_ArrVal_401 Int) (|ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base| Int)) (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base|) |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.offset|))) (= (mod (select (select (store |c_#memory_int| |ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base| (store (store (select |c_#memory_int| |ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base|) |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.offset| .cse2) (+ 8 |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.offset|) v_ArrVal_401)) |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base|) |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.offset|) 18446744073709551616) (mod .cse2 18446744073709551616)))) (<= 0 |c_#StackHeapBarrier|))) is different from false [2022-07-12 11:01:59,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1972357272] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:01:59,729 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 11:01:59,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 24] total 34 [2022-07-12 11:01:59,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252154910] [2022-07-12 11:01:59,730 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 11:01:59,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-12 11:01:59,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:01:59,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-12 11:01:59,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=2272, Unknown=3, NotChecked=96, Total=2550 [2022-07-12 11:01:59,732 INFO L87 Difference]: Start difference. First operand 137 states and 186 transitions. Second operand has 34 states, 29 states have (on average 4.0) internal successors, (116), 30 states have internal predecessors, (116), 13 states have call successors, (35), 8 states have call predecessors, (35), 12 states have return successors, (34), 9 states have call predecessors, (34), 13 states have call successors, (34) [2022-07-12 11:02:05,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:02:05,128 INFO L93 Difference]: Finished difference Result 402 states and 549 transitions. [2022-07-12 11:02:05,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-07-12 11:02:05,129 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 29 states have (on average 4.0) internal successors, (116), 30 states have internal predecessors, (116), 13 states have call successors, (35), 8 states have call predecessors, (35), 12 states have return successors, (34), 9 states have call predecessors, (34), 13 states have call successors, (34) Word has length 114 [2022-07-12 11:02:05,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:02:05,131 INFO L225 Difference]: With dead ends: 402 [2022-07-12 11:02:05,131 INFO L226 Difference]: Without dead ends: 307 [2022-07-12 11:02:05,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 181 SyntacticMatches, 10 SemanticMatches, 97 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2518 ImplicationChecksByTransitivity, 32.5s TimeCoverageRelationStatistics Valid=853, Invalid=8654, Unknown=3, NotChecked=192, Total=9702 [2022-07-12 11:02:05,134 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 419 mSDsluCounter, 1255 mSDsCounter, 0 mSdLazyCounter, 4773 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 1415 SdHoareTripleChecker+Invalid, 5681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 4773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 601 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:02:05,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 1415 Invalid, 5681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 4773 Invalid, 0 Unknown, 601 Unchecked, 3.1s Time] [2022-07-12 11:02:05,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2022-07-12 11:02:05,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 266. [2022-07-12 11:02:05,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 165 states have (on average 1.1696969696969697) internal successors, (193), 169 states have internal predecessors, (193), 73 states have call successors, (73), 24 states have call predecessors, (73), 27 states have return successors, (86), 72 states have call predecessors, (86), 71 states have call successors, (86) [2022-07-12 11:02:05,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 352 transitions. [2022-07-12 11:02:05,150 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 352 transitions. Word has length 114 [2022-07-12 11:02:05,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:02:05,151 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 352 transitions. [2022-07-12 11:02:05,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 29 states have (on average 4.0) internal successors, (116), 30 states have internal predecessors, (116), 13 states have call successors, (35), 8 states have call predecessors, (35), 12 states have return successors, (34), 9 states have call predecessors, (34), 13 states have call successors, (34) [2022-07-12 11:02:05,151 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 352 transitions. [2022-07-12 11:02:05,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-07-12 11:02:05,152 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:02:05,153 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:02:05,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-12 11:02:05,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:02:05,359 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:02:05,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:02:05,360 INFO L85 PathProgramCache]: Analyzing trace with hash -448097721, now seen corresponding path program 1 times [2022-07-12 11:02:05,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:02:05,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394664017] [2022-07-12 11:02:05,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:02:05,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:02:05,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:05,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:02:05,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:05,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:02:05,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:05,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:02:05,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:05,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:02:05,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:05,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:02:05,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:05,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 11:02:05,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:05,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:02:05,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:05,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:02:05,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:05,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 11:02:05,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:05,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:02:05,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:05,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 11:02:05,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:05,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 11:02:05,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:05,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 11:02:05,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:05,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 11:02:05,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:05,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-12 11:02:05,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:05,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:02:05,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:05,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:02:05,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:05,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 11:02:05,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:05,781 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-07-12 11:02:05,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:02:05,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394664017] [2022-07-12 11:02:05,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394664017] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:02:05,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [373782312] [2022-07-12 11:02:05,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:02:05,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:02:05,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:02:05,783 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:02:05,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-12 11:02:06,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:06,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 2751 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-12 11:02:06,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:02:06,320 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-12 11:02:06,321 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:02:06,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [373782312] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:02:06,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:02:06,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [14] total 21 [2022-07-12 11:02:06,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670666253] [2022-07-12 11:02:06,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:02:06,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 11:02:06,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:02:06,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 11:02:06,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2022-07-12 11:02:06,323 INFO L87 Difference]: Start difference. First operand 266 states and 352 transitions. Second operand has 9 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 3 states have call successors, (19), 2 states have call predecessors, (19), 4 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2022-07-12 11:02:06,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:02:06,454 INFO L93 Difference]: Finished difference Result 363 states and 488 transitions. [2022-07-12 11:02:06,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 11:02:06,455 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 3 states have call successors, (19), 2 states have call predecessors, (19), 4 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 125 [2022-07-12 11:02:06,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:02:06,457 INFO L225 Difference]: With dead ends: 363 [2022-07-12 11:02:06,457 INFO L226 Difference]: Without dead ends: 276 [2022-07-12 11:02:06,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=490, Unknown=0, NotChecked=0, Total=552 [2022-07-12 11:02:06,458 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 12 mSDsluCounter, 1100 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1267 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:02:06,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1267 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 11:02:06,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2022-07-12 11:02:06,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 271. [2022-07-12 11:02:06,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 169 states have (on average 1.165680473372781) internal successors, (197), 174 states have internal predecessors, (197), 73 states have call successors, (73), 24 states have call predecessors, (73), 28 states have return successors, (94), 72 states have call predecessors, (94), 71 states have call successors, (94) [2022-07-12 11:02:06,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 364 transitions. [2022-07-12 11:02:06,482 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 364 transitions. Word has length 125 [2022-07-12 11:02:06,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:02:06,482 INFO L495 AbstractCegarLoop]: Abstraction has 271 states and 364 transitions. [2022-07-12 11:02:06,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 3 states have call successors, (19), 2 states have call predecessors, (19), 4 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2022-07-12 11:02:06,482 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 364 transitions. [2022-07-12 11:02:06,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-12 11:02:06,483 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:02:06,483 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:02:06,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-12 11:02:06,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:02:06,694 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:02:06,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:02:06,695 INFO L85 PathProgramCache]: Analyzing trace with hash -276342452, now seen corresponding path program 1 times [2022-07-12 11:02:06,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:02:06,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336829570] [2022-07-12 11:02:06,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:02:06,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:02:06,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:06,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:02:06,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:06,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:02:06,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:06,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:02:06,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:06,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:02:06,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:07,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:02:07,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:07,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 11:02:07,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:07,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:02:07,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:07,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:02:07,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:07,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 11:02:07,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:07,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:02:07,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:07,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 11:02:07,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:07,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 11:02:07,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:07,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 11:02:07,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:07,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 11:02:07,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:07,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 11:02:07,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:07,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:02:07,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:07,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:02:07,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:07,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 11:02:07,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:07,326 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 5 proven. 30 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-07-12 11:02:07,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:02:07,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336829570] [2022-07-12 11:02:07,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336829570] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:02:07,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575099869] [2022-07-12 11:02:07,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:02:07,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:02:07,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:02:07,328 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:02:07,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-12 11:02:07,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:07,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 2756 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 11:02:07,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:02:07,772 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-07-12 11:02:07,772 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:02:07,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [575099869] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:02:07,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:02:07,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [22] total 24 [2022-07-12 11:02:07,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026817676] [2022-07-12 11:02:07,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:02:07,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 11:02:07,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:02:07,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 11:02:07,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=484, Unknown=0, NotChecked=0, Total=552 [2022-07-12 11:02:07,774 INFO L87 Difference]: Start difference. First operand 271 states and 364 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-12 11:02:07,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:02:07,932 INFO L93 Difference]: Finished difference Result 454 states and 624 transitions. [2022-07-12 11:02:07,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 11:02:07,933 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 127 [2022-07-12 11:02:07,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:02:07,934 INFO L225 Difference]: With dead ends: 454 [2022-07-12 11:02:07,934 INFO L226 Difference]: Without dead ends: 271 [2022-07-12 11:02:07,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 158 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=567, Unknown=0, NotChecked=0, Total=650 [2022-07-12 11:02:07,935 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 17 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 34 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:02:07,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 597 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 34 Unchecked, 0.1s Time] [2022-07-12 11:02:07,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2022-07-12 11:02:07,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2022-07-12 11:02:07,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 169 states have (on average 1.1538461538461537) internal successors, (195), 174 states have internal predecessors, (195), 73 states have call successors, (73), 24 states have call predecessors, (73), 28 states have return successors, (94), 72 states have call predecessors, (94), 71 states have call successors, (94) [2022-07-12 11:02:07,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 362 transitions. [2022-07-12 11:02:07,948 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 362 transitions. Word has length 127 [2022-07-12 11:02:07,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:02:07,948 INFO L495 AbstractCegarLoop]: Abstraction has 271 states and 362 transitions. [2022-07-12 11:02:07,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-12 11:02:07,949 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 362 transitions. [2022-07-12 11:02:07,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-12 11:02:07,950 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:02:07,950 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:02:07,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-12 11:02:08,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:02:08,163 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:02:08,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:02:08,164 INFO L85 PathProgramCache]: Analyzing trace with hash 284357326, now seen corresponding path program 1 times [2022-07-12 11:02:08,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:02:08,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509177244] [2022-07-12 11:02:08,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:02:08,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:02:08,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:08,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:02:08,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:08,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:02:08,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:08,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:02:08,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:08,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:02:08,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:08,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:02:08,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:08,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 11:02:08,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:08,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:02:08,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:08,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:02:08,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:08,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 11:02:08,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:08,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:02:08,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:08,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 11:02:08,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:08,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 11:02:08,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:08,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 11:02:08,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:08,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 11:02:08,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:08,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 11:02:08,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:08,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:02:08,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:08,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:02:08,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:08,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 11:02:08,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:08,776 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 1 proven. 35 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2022-07-12 11:02:08,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:02:08,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509177244] [2022-07-12 11:02:08,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509177244] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:02:08,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082604537] [2022-07-12 11:02:08,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:02:08,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:02:08,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:02:08,778 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:02:08,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-12 11:02:09,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:09,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 2761 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-12 11:02:09,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:02:09,401 INFO L356 Elim1Store]: treesize reduction 70, result has 26.3 percent of original size [2022-07-12 11:02:09,401 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 45 [2022-07-12 11:02:09,497 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-12 11:02:09,498 INFO L390 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 44 treesize of output 24 [2022-07-12 11:02:09,569 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 76 proven. 8 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-07-12 11:02:09,570 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:02:09,838 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-07-12 11:02:09,868 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-12 11:02:09,868 INFO L390 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 30 treesize of output 25 [2022-07-12 11:02:09,887 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-07-12 11:02:09,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082604537] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 11:02:09,887 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 11:02:09,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 13, 11] total 31 [2022-07-12 11:02:09,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085001605] [2022-07-12 11:02:09,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 11:02:09,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-12 11:02:09,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:02:09,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-12 11:02:09,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=841, Unknown=0, NotChecked=0, Total=930 [2022-07-12 11:02:09,888 INFO L87 Difference]: Start difference. First operand 271 states and 362 transitions. Second operand has 31 states, 28 states have (on average 4.357142857142857) internal successors, (122), 29 states have internal predecessors, (122), 15 states have call successors, (45), 7 states have call predecessors, (45), 10 states have return successors, (44), 12 states have call predecessors, (44), 15 states have call successors, (44) [2022-07-12 11:02:15,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:02:15,878 INFO L93 Difference]: Finished difference Result 560 states and 793 transitions. [2022-07-12 11:02:15,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-12 11:02:15,878 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 28 states have (on average 4.357142857142857) internal successors, (122), 29 states have internal predecessors, (122), 15 states have call successors, (45), 7 states have call predecessors, (45), 10 states have return successors, (44), 12 states have call predecessors, (44), 15 states have call successors, (44) Word has length 127 [2022-07-12 11:02:15,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:02:15,880 INFO L225 Difference]: With dead ends: 560 [2022-07-12 11:02:15,880 INFO L226 Difference]: Without dead ends: 420 [2022-07-12 11:02:15,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 274 SyntacticMatches, 9 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=272, Invalid=2178, Unknown=0, NotChecked=0, Total=2450 [2022-07-12 11:02:15,882 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 374 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 3494 mSolverCounterSat, 522 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 4516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 522 IncrementalHoareTripleChecker+Valid, 3494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 500 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-12 11:02:15,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 844 Invalid, 4516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [522 Valid, 3494 Invalid, 0 Unknown, 500 Unchecked, 2.3s Time] [2022-07-12 11:02:15,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2022-07-12 11:02:15,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 328. [2022-07-12 11:02:15,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 202 states have (on average 1.1485148514851484) internal successors, (232), 205 states have internal predecessors, (232), 96 states have call successors, (96), 27 states have call predecessors, (96), 29 states have return successors, (122), 95 states have call predecessors, (122), 94 states have call successors, (122) [2022-07-12 11:02:15,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 450 transitions. [2022-07-12 11:02:15,919 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 450 transitions. Word has length 127 [2022-07-12 11:02:15,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:02:15,920 INFO L495 AbstractCegarLoop]: Abstraction has 328 states and 450 transitions. [2022-07-12 11:02:15,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 28 states have (on average 4.357142857142857) internal successors, (122), 29 states have internal predecessors, (122), 15 states have call successors, (45), 7 states have call predecessors, (45), 10 states have return successors, (44), 12 states have call predecessors, (44), 15 states have call successors, (44) [2022-07-12 11:02:15,920 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 450 transitions. [2022-07-12 11:02:15,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-07-12 11:02:15,922 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:02:15,922 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:02:15,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-12 11:02:16,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-07-12 11:02:16,143 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:02:16,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:02:16,143 INFO L85 PathProgramCache]: Analyzing trace with hash 2040741793, now seen corresponding path program 1 times [2022-07-12 11:02:16,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:02:16,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278313605] [2022-07-12 11:02:16,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:02:16,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:02:16,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:16,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:02:16,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:16,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:02:16,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:16,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:02:16,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:16,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:02:16,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:16,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:02:16,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:16,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 11:02:16,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:16,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 11:02:16,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:16,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 11:02:16,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:16,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 11:02:16,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:16,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 11:02:16,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:16,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 11:02:16,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:16,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 11:02:16,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:16,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 11:02:16,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:16,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 11:02:16,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:16,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:02:16,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:16,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:02:16,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:16,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 11:02:16,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:16,404 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2022-07-12 11:02:16,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:02:16,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278313605] [2022-07-12 11:02:16,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278313605] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:02:16,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778452135] [2022-07-12 11:02:16,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:02:16,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:02:16,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:02:16,406 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:02:16,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-12 11:02:16,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:16,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 2728 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-12 11:02:16,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:02:16,825 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-07-12 11:02:16,825 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:02:16,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778452135] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:02:16,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:02:16,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 12 [2022-07-12 11:02:16,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442108133] [2022-07-12 11:02:16,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:02:16,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 11:02:16,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:02:16,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 11:02:16,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-07-12 11:02:16,828 INFO L87 Difference]: Start difference. First operand 328 states and 450 transitions. Second operand has 9 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 3 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-07-12 11:02:16,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:02:16,952 INFO L93 Difference]: Finished difference Result 490 states and 673 transitions. [2022-07-12 11:02:16,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 11:02:16,953 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 3 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 124 [2022-07-12 11:02:16,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:02:16,954 INFO L225 Difference]: With dead ends: 490 [2022-07-12 11:02:16,955 INFO L226 Difference]: Without dead ends: 333 [2022-07-12 11:02:16,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 154 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-07-12 11:02:16,956 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 11 mSDsluCounter, 1088 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1253 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:02:16,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1253 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 11:02:16,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2022-07-12 11:02:16,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 328. [2022-07-12 11:02:16,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 202 states have (on average 1.1485148514851484) internal successors, (232), 205 states have internal predecessors, (232), 96 states have call successors, (96), 27 states have call predecessors, (96), 29 states have return successors, (120), 95 states have call predecessors, (120), 94 states have call successors, (120) [2022-07-12 11:02:16,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 448 transitions. [2022-07-12 11:02:16,975 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 448 transitions. Word has length 124 [2022-07-12 11:02:16,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:02:16,975 INFO L495 AbstractCegarLoop]: Abstraction has 328 states and 448 transitions. [2022-07-12 11:02:16,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 3 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-07-12 11:02:16,975 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 448 transitions. [2022-07-12 11:02:16,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-12 11:02:16,977 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:02:16,977 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:02:16,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-12 11:02:17,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-12 11:02:17,183 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:02:17,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:02:17,184 INFO L85 PathProgramCache]: Analyzing trace with hash -153440338, now seen corresponding path program 2 times [2022-07-12 11:02:17,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:02:17,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38613768] [2022-07-12 11:02:17,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:02:17,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:02:17,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:17,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:02:17,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:17,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:02:17,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:17,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:02:17,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:17,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:02:17,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:17,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:02:17,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:17,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 11:02:17,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:17,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:02:17,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:17,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:02:17,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:17,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:02:17,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:17,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 11:02:17,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:17,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 11:02:17,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:17,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 11:02:17,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:17,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 11:02:17,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:17,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 11:02:17,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:17,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 11:02:17,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:17,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:02:17,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:17,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:02:17,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:17,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 11:02:17,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:17,923 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2022-07-12 11:02:17,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:02:17,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38613768] [2022-07-12 11:02:17,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38613768] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:02:17,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169538744] [2022-07-12 11:02:17,923 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 11:02:17,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:02:17,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:02:17,925 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:02:17,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-12 11:02:18,802 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 11:02:18,802 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 11:02:18,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 2761 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-12 11:02:18,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:02:18,819 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-12 11:02:19,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 11:02:19,125 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-12 11:02:19,200 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 80 proven. 4 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-07-12 11:02:19,200 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:02:19,349 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_961 (Array Int Int))) (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#rhs~0#1.base| v_ArrVal_961) |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.base|) |c_ULTIMATE.start_aws_byte_cursor_eq_harness_~#lhs~0#1.offset|) 18446744073709551616) 0)) is different from false [2022-07-12 11:02:19,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [169538744] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:02:19,353 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 11:02:19,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 27 [2022-07-12 11:02:19,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204644757] [2022-07-12 11:02:19,354 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 11:02:19,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-12 11:02:19,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:02:19,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-12 11:02:19,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=727, Unknown=1, NotChecked=54, Total=870 [2022-07-12 11:02:19,355 INFO L87 Difference]: Start difference. First operand 328 states and 448 transitions. Second operand has 27 states, 23 states have (on average 4.304347826086956) internal successors, (99), 23 states have internal predecessors, (99), 11 states have call successors, (37), 5 states have call predecessors, (37), 8 states have return successors, (36), 9 states have call predecessors, (36), 11 states have call successors, (36) [2022-07-12 11:02:23,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:02:23,760 INFO L93 Difference]: Finished difference Result 682 states and 1001 transitions. [2022-07-12 11:02:23,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-12 11:02:23,761 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 23 states have (on average 4.304347826086956) internal successors, (99), 23 states have internal predecessors, (99), 11 states have call successors, (37), 5 states have call predecessors, (37), 8 states have return successors, (36), 9 states have call predecessors, (36), 11 states have call successors, (36) Word has length 127 [2022-07-12 11:02:23,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:02:23,764 INFO L225 Difference]: With dead ends: 682 [2022-07-12 11:02:23,764 INFO L226 Difference]: Without dead ends: 521 [2022-07-12 11:02:23,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 236 SyntacticMatches, 5 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=316, Invalid=2443, Unknown=1, NotChecked=102, Total=2862 [2022-07-12 11:02:23,785 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 421 mSDsluCounter, 787 mSDsCounter, 0 mSdLazyCounter, 4621 mSolverCounterSat, 600 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 915 SdHoareTripleChecker+Invalid, 5598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 600 IncrementalHoareTripleChecker+Valid, 4621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 377 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-07-12 11:02:23,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 915 Invalid, 5598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [600 Valid, 4621 Invalid, 0 Unknown, 377 Unchecked, 3.5s Time] [2022-07-12 11:02:23,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2022-07-12 11:02:23,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 387. [2022-07-12 11:02:23,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 231 states have (on average 1.147186147186147) internal successors, (265), 232 states have internal predecessors, (265), 126 states have call successors, (126), 29 states have call predecessors, (126), 29 states have return successors, (160), 125 states have call predecessors, (160), 124 states have call successors, (160) [2022-07-12 11:02:23,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 551 transitions. [2022-07-12 11:02:23,811 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 551 transitions. Word has length 127 [2022-07-12 11:02:23,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:02:23,812 INFO L495 AbstractCegarLoop]: Abstraction has 387 states and 551 transitions. [2022-07-12 11:02:23,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 23 states have (on average 4.304347826086956) internal successors, (99), 23 states have internal predecessors, (99), 11 states have call successors, (37), 5 states have call predecessors, (37), 8 states have return successors, (36), 9 states have call predecessors, (36), 11 states have call successors, (36) [2022-07-12 11:02:23,812 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 551 transitions. [2022-07-12 11:02:23,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-07-12 11:02:23,813 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:02:23,813 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:02:23,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-12 11:02:24,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-12 11:02:24,031 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:02:24,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:02:24,032 INFO L85 PathProgramCache]: Analyzing trace with hash -2001210328, now seen corresponding path program 2 times [2022-07-12 11:02:24,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:02:24,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871429646] [2022-07-12 11:02:24,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:02:24,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:02:24,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:24,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:02:24,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:24,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:02:24,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:24,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:02:24,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:24,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:02:24,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:24,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:02:24,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:24,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:02:24,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:24,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:02:24,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:24,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 11:02:24,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:24,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 11:02:24,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:24,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 11:02:24,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:24,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 11:02:24,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:24,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 11:02:24,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:24,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 11:02:24,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:24,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 11:02:24,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:24,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:02:24,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:24,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:02:24,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:24,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 11:02:24,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:24,429 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-07-12 11:02:24,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:02:24,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871429646] [2022-07-12 11:02:24,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871429646] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:02:24,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1221296374] [2022-07-12 11:02:24,430 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 11:02:24,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:02:24,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:02:24,431 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:02:24,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-12 11:02:25,368 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 11:02:25,368 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 11:02:25,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 2738 conjuncts, 53 conjunts are in the unsatisfiable core [2022-07-12 11:02:25,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:02:25,384 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-12 11:02:25,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:02:25,439 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 24 [2022-07-12 11:02:26,323 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_10| Int) (|v_ULTIMATE.start_aws_byte_cursor_eq_~b#1.base_BEFORE_CALL_12| Int)) (and (= (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_10|) 0) (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_cursor_eq_~b#1.base_BEFORE_CALL_12|) 0)) (not (= |v_ULTIMATE.start_aws_byte_cursor_eq_~b#1.base_BEFORE_CALL_12| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_10|)))) is different from true [2022-07-12 11:02:27,178 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~b#1.base_BEFORE_CALL_13| Int) (|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_11| Int)) (and (not (= |v_ULTIMATE.start_aws_byte_cursor_eq_~b#1.base_BEFORE_CALL_13| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_11|)) (= (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_11|) 0) (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_cursor_eq_~b#1.base_BEFORE_CALL_13|) 0)))) is different from true [2022-07-12 11:02:27,980 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_12| Int) (|v_ULTIMATE.start_aws_byte_cursor_eq_~b#1.base_BEFORE_CALL_14| Int)) (and (not (= |v_ULTIMATE.start_aws_byte_cursor_eq_~b#1.base_BEFORE_CALL_14| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_12|)) (= (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_12|) 0) (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_cursor_eq_~b#1.base_BEFORE_CALL_14|) 0)))) is different from true [2022-07-12 11:02:28,802 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_13| Int) (|v_ULTIMATE.start_aws_byte_cursor_eq_~b#1.base_BEFORE_CALL_15| Int)) (and (not (= |v_ULTIMATE.start_aws_byte_cursor_eq_~b#1.base_BEFORE_CALL_15| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_13|)) (= (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_13|) 0) (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_cursor_eq_~b#1.base_BEFORE_CALL_15|) 0)))) is different from true [2022-07-12 11:02:28,846 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2022-07-12 11:02:28,900 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 65 proven. 0 refuted. 16 times theorem prover too weak. 31 trivial. 11 not checked. [2022-07-12 11:02:28,900 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:02:33,234 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2022-07-12 11:02:33,295 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2022-07-12 11:02:33,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1221296374] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-12 11:02:33,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-12 11:02:33,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [14, 14] total 31 [2022-07-12 11:02:33,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051408327] [2022-07-12 11:02:33,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:02:33,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 11:02:33,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:02:33,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 11:02:33,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=633, Unknown=4, NotChecked=212, Total=930 [2022-07-12 11:02:33,296 INFO L87 Difference]: Start difference. First operand 387 states and 551 transitions. Second operand has 9 states, 8 states have (on average 5.625) internal successors, (45), 9 states have internal predecessors, (45), 7 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 6 states have call predecessors, (17), 7 states have call successors, (17) [2022-07-12 11:02:33,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:02:33,779 INFO L93 Difference]: Finished difference Result 612 states and 921 transitions. [2022-07-12 11:02:33,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 11:02:33,780 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 9 states have internal predecessors, (45), 7 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 6 states have call predecessors, (17), 7 states have call successors, (17) Word has length 126 [2022-07-12 11:02:33,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:02:33,783 INFO L225 Difference]: With dead ends: 612 [2022-07-12 11:02:33,783 INFO L226 Difference]: Without dead ends: 500 [2022-07-12 11:02:33,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 262 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=97, Invalid=785, Unknown=4, NotChecked=236, Total=1122 [2022-07-12 11:02:33,789 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 86 mSDsluCounter, 1143 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 1369 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 165 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 11:02:33,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 1369 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 397 Invalid, 0 Unknown, 165 Unchecked, 0.4s Time] [2022-07-12 11:02:33,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2022-07-12 11:02:33,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 411. [2022-07-12 11:02:33,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 242 states have (on average 1.1446280991735538) internal successors, (277), 245 states have internal predecessors, (277), 137 states have call successors, (137), 30 states have call predecessors, (137), 31 states have return successors, (180), 135 states have call predecessors, (180), 135 states have call successors, (180) [2022-07-12 11:02:33,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 594 transitions. [2022-07-12 11:02:33,846 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 594 transitions. Word has length 126 [2022-07-12 11:02:33,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:02:33,846 INFO L495 AbstractCegarLoop]: Abstraction has 411 states and 594 transitions. [2022-07-12 11:02:33,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 9 states have internal predecessors, (45), 7 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 6 states have call predecessors, (17), 7 states have call successors, (17) [2022-07-12 11:02:33,846 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 594 transitions. [2022-07-12 11:02:33,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-12 11:02:33,849 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:02:33,849 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:02:33,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-12 11:02:34,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-12 11:02:34,056 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:02:34,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:02:34,056 INFO L85 PathProgramCache]: Analyzing trace with hash -966185318, now seen corresponding path program 1 times [2022-07-12 11:02:34,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:02:34,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501572491] [2022-07-12 11:02:34,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:02:34,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:02:34,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:34,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:02:34,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:34,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:02:34,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:34,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:02:34,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:34,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:02:34,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:34,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:02:34,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:34,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:02:34,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:34,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:02:34,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:34,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 11:02:34,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:34,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 11:02:34,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:34,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 11:02:34,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:34,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 11:02:34,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:34,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 11:02:34,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:34,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 11:02:34,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:34,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 11:02:34,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:34,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:02:34,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:34,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:02:34,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:34,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 11:02:34,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:34,380 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 12 proven. 16 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2022-07-12 11:02:34,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:02:34,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501572491] [2022-07-12 11:02:34,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501572491] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:02:34,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868091768] [2022-07-12 11:02:34,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:02:34,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:02:34,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:02:34,382 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:02:34,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-12 11:02:34,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:34,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 2741 conjuncts, 52 conjunts are in the unsatisfiable core [2022-07-12 11:02:34,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:02:35,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:02:35,056 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-12 11:02:35,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 37 [2022-07-12 11:02:35,522 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-12 11:02:35,522 INFO L390 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 40 treesize of output 20 [2022-07-12 11:02:35,609 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 46 proven. 42 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-12 11:02:35,610 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:02:37,876 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2022-07-12 11:02:37,935 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-12 11:02:37,935 INFO L390 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 31 treesize of output 26 [2022-07-12 11:02:37,952 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2022-07-12 11:02:37,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868091768] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 11:02:37,952 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 11:02:37,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 13] total 31 [2022-07-12 11:02:37,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747733742] [2022-07-12 11:02:37,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 11:02:37,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-12 11:02:37,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:02:37,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-12 11:02:37,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=842, Unknown=1, NotChecked=0, Total=930 [2022-07-12 11:02:37,954 INFO L87 Difference]: Start difference. First operand 411 states and 594 transitions. Second operand has 31 states, 28 states have (on average 4.428571428571429) internal successors, (124), 29 states have internal predecessors, (124), 16 states have call successors, (45), 7 states have call predecessors, (45), 8 states have return successors, (44), 13 states have call predecessors, (44), 16 states have call successors, (44) [2022-07-12 11:02:41,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:02:41,361 INFO L93 Difference]: Finished difference Result 965 states and 1503 transitions. [2022-07-12 11:02:41,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-07-12 11:02:41,361 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 28 states have (on average 4.428571428571429) internal successors, (124), 29 states have internal predecessors, (124), 16 states have call successors, (45), 7 states have call predecessors, (45), 8 states have return successors, (44), 13 states have call predecessors, (44), 16 states have call successors, (44) Word has length 127 [2022-07-12 11:02:41,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:02:41,366 INFO L225 Difference]: With dead ends: 965 [2022-07-12 11:02:41,366 INFO L226 Difference]: Without dead ends: 853 [2022-07-12 11:02:41,367 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 254 SyntacticMatches, 15 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=288, Invalid=2903, Unknown=1, NotChecked=0, Total=3192 [2022-07-12 11:02:41,368 INFO L413 NwaCegarLoop]: 526 mSDtfsCounter, 187 mSDsluCounter, 6134 mSDsCounter, 0 mSdLazyCounter, 4187 mSolverCounterSat, 225 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 6660 SdHoareTripleChecker+Invalid, 5854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 225 IncrementalHoareTripleChecker+Valid, 4187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1442 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-12 11:02:41,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 6660 Invalid, 5854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [225 Valid, 4187 Invalid, 0 Unknown, 1442 Unchecked, 2.5s Time] [2022-07-12 11:02:41,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2022-07-12 11:02:41,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 477. [2022-07-12 11:02:41,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 282 states have (on average 1.1347517730496455) internal successors, (320), 287 states have internal predecessors, (320), 157 states have call successors, (157), 34 states have call predecessors, (157), 37 states have return successors, (214), 155 states have call predecessors, (214), 155 states have call successors, (214) [2022-07-12 11:02:41,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 691 transitions. [2022-07-12 11:02:41,413 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 691 transitions. Word has length 127 [2022-07-12 11:02:41,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:02:41,414 INFO L495 AbstractCegarLoop]: Abstraction has 477 states and 691 transitions. [2022-07-12 11:02:41,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 28 states have (on average 4.428571428571429) internal successors, (124), 29 states have internal predecessors, (124), 16 states have call successors, (45), 7 states have call predecessors, (45), 8 states have return successors, (44), 13 states have call predecessors, (44), 16 states have call successors, (44) [2022-07-12 11:02:41,415 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 691 transitions. [2022-07-12 11:02:41,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-12 11:02:41,416 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:02:41,416 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:02:41,437 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-12 11:02:41,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-12 11:02:41,631 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:02:41,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:02:41,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1375009543, now seen corresponding path program 1 times [2022-07-12 11:02:41,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:02:41,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891985435] [2022-07-12 11:02:41,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:02:41,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:02:41,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:41,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:02:41,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:41,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:02:41,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:41,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:02:41,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:41,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:02:41,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:41,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:02:41,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:41,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:02:41,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:41,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:02:41,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:41,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 11:02:41,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:41,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 11:02:41,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:41,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 11:02:41,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:41,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 11:02:41,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:41,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 11:02:41,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:42,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 11:02:42,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:42,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 11:02:42,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:42,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:02:42,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:42,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:02:42,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:42,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 11:02:42,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:42,036 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-07-12 11:02:42,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:02:42,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891985435] [2022-07-12 11:02:42,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891985435] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:02:42,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932960054] [2022-07-12 11:02:42,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:02:42,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:02:42,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:02:42,038 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:02:42,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-12 11:02:42,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:42,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 2742 conjuncts, 70 conjunts are in the unsatisfiable core [2022-07-12 11:02:42,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:02:45,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:02:45,236 INFO L356 Elim1Store]: treesize reduction 51, result has 25.0 percent of original size [2022-07-12 11:02:45,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 40 [2022-07-12 11:02:45,240 INFO L390 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 17 treesize of output 13 [2022-07-12 11:02:45,245 INFO L390 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 17 treesize of output 13 [2022-07-12 11:02:45,248 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2022-07-12 11:02:45,252 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2022-07-12 11:02:45,346 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-07-12 11:02:45,348 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-12 11:02:45,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2022-07-12 11:02:45,409 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-12 11:02:45,409 INFO L390 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 35 treesize of output 19 [2022-07-12 11:02:45,410 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-12 11:02:45,530 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 70 proven. 4 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-07-12 11:02:45,530 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:02:46,171 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-07-12 11:02:46,172 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-12 11:02:46,173 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-07-12 11:02:46,395 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 11:02:46,395 INFO L390 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 51 treesize of output 54 [2022-07-12 11:02:46,403 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 11:02:46,403 INFO L390 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 39 treesize of output 42 [2022-07-12 11:02:46,502 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-12 11:02:46,503 INFO L390 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 26 treesize of output 25 [2022-07-12 11:02:46,556 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-07-12 11:02:46,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [932960054] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 11:02:46,556 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 11:02:46,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18, 15] total 42 [2022-07-12 11:02:46,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805585001] [2022-07-12 11:02:46,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 11:02:46,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-12 11:02:46,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:02:46,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-12 11:02:46,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1530, Unknown=0, NotChecked=0, Total=1722 [2022-07-12 11:02:46,558 INFO L87 Difference]: Start difference. First operand 477 states and 691 transitions. Second operand has 42 states, 40 states have (on average 3.8) internal successors, (152), 40 states have internal predecessors, (152), 14 states have call successors, (46), 8 states have call predecessors, (46), 12 states have return successors, (45), 12 states have call predecessors, (45), 14 states have call successors, (45) [2022-07-12 11:02:49,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:02:49,486 INFO L93 Difference]: Finished difference Result 814 states and 1182 transitions. [2022-07-12 11:02:49,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-07-12 11:02:49,491 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 40 states have (on average 3.8) internal successors, (152), 40 states have internal predecessors, (152), 14 states have call successors, (46), 8 states have call predecessors, (46), 12 states have return successors, (45), 12 states have call predecessors, (45), 14 states have call successors, (45) Word has length 127 [2022-07-12 11:02:49,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:02:49,494 INFO L225 Difference]: With dead ends: 814 [2022-07-12 11:02:49,494 INFO L226 Difference]: Without dead ends: 629 [2022-07-12 11:02:49,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 270 SyntacticMatches, 5 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1539 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=835, Invalid=4864, Unknown=1, NotChecked=0, Total=5700 [2022-07-12 11:02:49,496 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 399 mSDsluCounter, 1483 mSDsCounter, 0 mSdLazyCounter, 2468 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 1674 SdHoareTripleChecker+Invalid, 3024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 2468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 420 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-12 11:02:49,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 1674 Invalid, 3024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 2468 Invalid, 0 Unknown, 420 Unchecked, 1.5s Time] [2022-07-12 11:02:49,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2022-07-12 11:02:49,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 552. [2022-07-12 11:02:49,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 339 states have (on average 1.1327433628318584) internal successors, (384), 346 states have internal predecessors, (384), 165 states have call successors, (165), 43 states have call predecessors, (165), 47 states have return successors, (238), 162 states have call predecessors, (238), 163 states have call successors, (238) [2022-07-12 11:02:49,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 787 transitions. [2022-07-12 11:02:49,539 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 787 transitions. Word has length 127 [2022-07-12 11:02:49,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:02:49,539 INFO L495 AbstractCegarLoop]: Abstraction has 552 states and 787 transitions. [2022-07-12 11:02:49,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 40 states have (on average 3.8) internal successors, (152), 40 states have internal predecessors, (152), 14 states have call successors, (46), 8 states have call predecessors, (46), 12 states have return successors, (45), 12 states have call predecessors, (45), 14 states have call successors, (45) [2022-07-12 11:02:49,540 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 787 transitions. [2022-07-12 11:02:49,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-07-12 11:02:49,542 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:02:49,542 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:02:49,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-12 11:02:49,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-12 11:02:49,755 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:02:49,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:02:49,756 INFO L85 PathProgramCache]: Analyzing trace with hash -226410282, now seen corresponding path program 1 times [2022-07-12 11:02:49,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:02:49,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795182620] [2022-07-12 11:02:49,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:02:49,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:02:49,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:49,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:02:49,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:49,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:02:49,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:49,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:02:49,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:49,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:02:49,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:49,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:02:49,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:49,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 11:02:49,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:49,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:02:49,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:49,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:02:49,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:49,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 11:02:49,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:49,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 11:02:49,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:49,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 11:02:49,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:49,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 11:02:49,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:49,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 11:02:49,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:49,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 11:02:49,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:49,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:02:49,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:49,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:02:49,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:49,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-12 11:02:49,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:49,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 11:02:49,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:49,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-12 11:02:49,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:49,982 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-07-12 11:02:49,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:02:49,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795182620] [2022-07-12 11:02:49,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795182620] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:02:49,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:02:49,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 11:02:49,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351244979] [2022-07-12 11:02:49,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:02:49,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 11:02:49,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:02:49,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 11:02:49,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-12 11:02:49,984 INFO L87 Difference]: Start difference. First operand 552 states and 787 transitions. Second operand has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) [2022-07-12 11:02:50,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:02:50,486 INFO L93 Difference]: Finished difference Result 564 states and 799 transitions. [2022-07-12 11:02:50,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 11:02:50,487 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) Word has length 125 [2022-07-12 11:02:50,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:02:50,489 INFO L225 Difference]: With dead ends: 564 [2022-07-12 11:02:50,489 INFO L226 Difference]: Without dead ends: 562 [2022-07-12 11:02:50,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-07-12 11:02:50,490 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 115 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 11:02:50,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 632 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 11:02:50,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2022-07-12 11:02:50,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 561. [2022-07-12 11:02:50,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 345 states have (on average 1.1304347826086956) internal successors, (390), 352 states have internal predecessors, (390), 166 states have call successors, (166), 45 states have call predecessors, (166), 49 states have return successors, (239), 163 states have call predecessors, (239), 164 states have call successors, (239) [2022-07-12 11:02:50,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 795 transitions. [2022-07-12 11:02:50,532 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 795 transitions. Word has length 125 [2022-07-12 11:02:50,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:02:50,532 INFO L495 AbstractCegarLoop]: Abstraction has 561 states and 795 transitions. [2022-07-12 11:02:50,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 1 states have call successors, (19) [2022-07-12 11:02:50,533 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 795 transitions. [2022-07-12 11:02:50,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-07-12 11:02:50,534 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:02:50,534 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:02:50,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 11:02:50,535 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:02:50,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:02:50,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1654758303, now seen corresponding path program 3 times [2022-07-12 11:02:50,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:02:50,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116579219] [2022-07-12 11:02:50,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:02:50,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:02:50,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:50,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:02:50,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:50,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:02:50,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:50,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:02:50,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:50,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:02:50,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:50,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:02:50,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:50,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 11:02:50,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:50,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 11:02:50,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:50,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 11:02:50,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:50,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 11:02:51,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:51,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:02:51,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:51,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 11:02:51,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:51,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 11:02:51,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:51,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 11:02:51,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:51,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 11:02:51,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:51,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-12 11:02:51,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:51,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:02:51,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:51,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:02:51,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:51,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 11:02:51,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:02:51,373 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-07-12 11:02:51,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:02:51,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116579219] [2022-07-12 11:02:51,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116579219] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:02:51,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143258996] [2022-07-12 11:02:51,374 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 11:02:51,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:02:51,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:02:51,376 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:02:51,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-12 11:02:52,559 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-12 11:02:52,559 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 11:02:52,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 2382 conjuncts, 55 conjunts are in the unsatisfiable core [2022-07-12 11:02:52,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:02:54,758 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_19| Int) (|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.offset_BEFORE_CALL_20| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_19|) (+ 8 |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.offset_BEFORE_CALL_20|)) 0))) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_19| Int) (|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.offset_BEFORE_CALL_20| Int)) (= (mod (select (select |c_#memory_int| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_19|) |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.offset_BEFORE_CALL_20|) 18446744073709551616) 0)) (exists ((|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_19| Int) (|v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.offset_BEFORE_CALL_20| Int)) (not (= 0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.base_BEFORE_CALL_19|) (+ 8 |v_ULTIMATE.start_aws_byte_cursor_eq_~a#1.offset_BEFORE_CALL_20|)))))) is different from true [2022-07-12 11:03:07,854 WARN L233 SmtUtils]: Spent 11.03s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 11:03:21,023 WARN L233 SmtUtils]: Spent 13.09s on a formula simplification that was a NOOP. DAG size: 42 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 11:03:36,716 WARN L233 SmtUtils]: Spent 11.83s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 11:03:49,434 WARN L233 SmtUtils]: Spent 10.87s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 11:04:02,457 WARN L233 SmtUtils]: Spent 10.92s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 11:04:15,417 WARN L233 SmtUtils]: Spent 10.86s on a formula simplification that was a NOOP. DAG size: 42 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 11:04:28,747 WARN L233 SmtUtils]: Spent 11.22s on a formula simplification that was a NOOP. DAG size: 42 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 11:04:39,815 WARN L233 SmtUtils]: Spent 10.95s on a formula simplification that was a NOOP. DAG size: 42 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 11:04:50,885 WARN L233 SmtUtils]: Spent 10.97s on a formula simplification that was a NOOP. DAG size: 42 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 11:04:50,901 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 44 proven. 3 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-07-12 11:04:50,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:04:58,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2143258996] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:04:58,994 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 11:04:58,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 18] total 41 [2022-07-12 11:04:58,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622569726] [2022-07-12 11:04:58,994 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 11:04:58,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-07-12 11:04:58,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:04:58,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-07-12 11:04:58,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=2580, Unknown=6, NotChecked=102, Total=2862 [2022-07-12 11:04:58,996 INFO L87 Difference]: Start difference. First operand 561 states and 795 transitions. Second operand has 41 states, 36 states have (on average 2.5555555555555554) internal successors, (92), 35 states have internal predecessors, (92), 15 states have call successors, (37), 5 states have call predecessors, (37), 9 states have return successors, (36), 12 states have call predecessors, (36), 15 states have call successors, (36)