./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_cursor_advance_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 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_advance_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 f26a5d85d152e590b5f8a93f229efbb28bdd5e77c34d7106bb5825fc4b732cf6 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 22:41:34,357 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 22:41:34,359 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 22:41:34,395 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 22:41:34,396 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 22:41:34,397 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 22:41:34,398 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 22:41:34,400 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 22:41:34,402 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 22:41:34,403 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 22:41:34,404 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 22:41:34,405 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 22:41:34,406 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 22:41:34,407 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 22:41:34,408 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 22:41:34,409 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 22:41:34,409 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 22:41:34,410 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 22:41:34,412 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 22:41:34,414 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 22:41:34,415 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 22:41:34,421 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 22:41:34,422 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 22:41:34,423 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 22:41:34,424 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 22:41:34,426 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 22:41:34,426 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 22:41:34,427 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 22:41:34,428 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 22:41:34,428 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 22:41:34,429 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 22:41:34,429 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 22:41:34,430 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 22:41:34,431 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 22:41:34,437 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 22:41:34,438 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 22:41:34,439 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 22:41:34,439 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 22:41:34,439 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 22:41:34,440 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 22:41:34,441 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 22:41:34,443 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 22:41:34,443 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-13 22:41:34,466 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 22:41:34,466 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 22:41:34,467 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 22:41:34,467 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 22:41:34,467 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 22:41:34,468 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 22:41:34,468 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 22:41:34,468 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 22:41:34,469 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 22:41:34,469 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 22:41:34,469 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 22:41:34,469 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 22:41:34,469 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 22:41:34,470 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 22:41:34,470 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 22:41:34,470 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 22:41:34,470 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 22:41:34,470 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 22:41:34,471 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 22:41:34,471 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 22:41:34,471 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 22:41:34,471 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 22:41:34,471 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 22:41:34,472 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 22:41:34,472 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 22:41:34,472 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 22:41:34,472 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 22:41:34,472 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 22:41:34,473 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 22:41:34,479 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 22:41:34,480 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 -> f26a5d85d152e590b5f8a93f229efbb28bdd5e77c34d7106bb5825fc4b732cf6 [2022-07-13 22:41:34,671 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 22:41:34,688 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 22:41:34,690 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 22:41:34,691 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 22:41:34,692 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 22:41:34,693 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_advance_harness.i [2022-07-13 22:41:34,740 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06947fb7b/b29945546fb748c78ba0e924b621e3c5/FLAG43a4c0ee3 [2022-07-13 22:41:35,412 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 22:41:35,413 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_advance_harness.i [2022-07-13 22:41:35,444 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06947fb7b/b29945546fb748c78ba0e924b621e3c5/FLAG43a4c0ee3 [2022-07-13 22:41:35,717 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06947fb7b/b29945546fb748c78ba0e924b621e3c5 [2022-07-13 22:41:35,719 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 22:41:35,720 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 22:41:35,721 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 22:41:35,721 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 22:41:35,724 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 22:41:35,725 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:41:35" (1/1) ... [2022-07-13 22:41:35,725 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7946ea2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:41:35, skipping insertion in model container [2022-07-13 22:41:35,726 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:41:35" (1/1) ... [2022-07-13 22:41:35,731 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 22:41:35,822 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 22:41:36,014 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_advance_harness.i[4497,4510] [2022-07-13 22:41:36,022 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_advance_harness.i[4557,4570] [2022-07-13 22:41:36,681 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:41:36,681 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:41:36,682 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:41:36,682 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:41:36,683 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:41:36,695 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:41:36,696 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:41:36,697 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:41:36,707 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:41:36,948 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-13 22:41:36,949 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-13 22:41:36,950 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-13 22:41:36,951 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-13 22:41:36,952 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-13 22:41:36,953 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-13 22:41:36,953 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-13 22:41:36,954 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-13 22:41:36,954 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-13 22:41:36,962 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-13 22:41:37,054 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-13 22:41:37,160 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:41:37,160 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:41:37,222 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 22:41:37,276 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 22:41:37,302 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_advance_harness.i[4497,4510] [2022-07-13 22:41:37,303 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_advance_harness.i[4557,4570] [2022-07-13 22:41:37,344 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:41:37,344 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:41:37,345 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:41:37,346 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:41:37,347 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:41:37,369 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:41:37,370 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:41:37,371 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:41:37,371 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:41:37,400 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-13 22:41:37,401 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-13 22:41:37,402 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-13 22:41:37,402 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-13 22:41:37,403 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-13 22:41:37,403 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-13 22:41:37,403 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-13 22:41:37,406 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-13 22:41:37,406 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-13 22:41:37,406 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-13 22:41:37,428 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-13 22:41:37,482 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:41:37,482 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:41:37,508 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 22:41:37,668 INFO L208 MainTranslator]: Completed translation [2022-07-13 22:41:37,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:41:37 WrapperNode [2022-07-13 22:41:37,669 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 22:41:37,670 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 22:41:37,670 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 22:41:37,670 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 22:41:37,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:41:37" (1/1) ... [2022-07-13 22:41:37,769 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:41:37" (1/1) ... [2022-07-13 22:41:37,856 INFO L137 Inliner]: procedures = 690, calls = 2642, calls flagged for inlining = 60, calls inlined = 7, statements flattened = 882 [2022-07-13 22:41:37,856 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 22:41:37,857 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 22:41:37,857 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 22:41:37,857 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 22:41:37,865 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:41:37" (1/1) ... [2022-07-13 22:41:37,865 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:41:37" (1/1) ... [2022-07-13 22:41:37,877 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:41:37" (1/1) ... [2022-07-13 22:41:37,878 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:41:37" (1/1) ... [2022-07-13 22:41:37,923 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:41:37" (1/1) ... [2022-07-13 22:41:37,935 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:41:37" (1/1) ... [2022-07-13 22:41:37,940 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:41:37" (1/1) ... [2022-07-13 22:41:37,954 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 22:41:37,958 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 22:41:37,959 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 22:41:37,959 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 22:41:37,960 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:41:37" (1/1) ... [2022-07-13 22:41:37,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 22:41:37,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:41:37,997 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-13 22:41:38,015 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-13 22:41:38,031 INFO L130 BoogieDeclarations]: Found specification of procedure aws_byte_cursor_is_valid [2022-07-13 22:41:38,032 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_byte_cursor_is_valid [2022-07-13 22:41:38,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 22:41:38,032 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-07-13 22:41:38,032 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-07-13 22:41:38,033 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 22:41:38,033 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-13 22:41:38,033 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-13 22:41:38,034 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 22:41:38,034 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 22:41:38,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 22:41:38,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 22:41:38,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 22:41:38,036 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-07-13 22:41:38,036 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-07-13 22:41:38,036 INFO L130 BoogieDeclarations]: Found specification of procedure assert_byte_from_buffer_matches [2022-07-13 22:41:38,036 INFO L138 BoogieDeclarations]: Found implementation of procedure assert_byte_from_buffer_matches [2022-07-13 22:41:38,036 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-13 22:41:38,036 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-13 22:41:38,037 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 22:41:38,037 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 22:41:38,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-13 22:41:38,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 22:41:38,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 22:41:38,343 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 22:41:38,345 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 22:41:39,254 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 22:41:39,260 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 22:41:39,260 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-13 22:41:39,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:41:39 BoogieIcfgContainer [2022-07-13 22:41:39,262 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 22:41:39,264 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 22:41:39,264 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 22:41:39,267 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 22:41:39,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 10:41:35" (1/3) ... [2022-07-13 22:41:39,268 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2064ae5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 10:41:39, skipping insertion in model container [2022-07-13 22:41:39,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:41:37" (2/3) ... [2022-07-13 22:41:39,268 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2064ae5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 10:41:39, skipping insertion in model container [2022-07-13 22:41:39,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:41:39" (3/3) ... [2022-07-13 22:41:39,269 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_cursor_advance_harness.i [2022-07-13 22:41:39,282 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 22:41:39,282 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 22:41:39,323 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 22:41:39,328 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@75c3df27, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2ed13377 [2022-07-13 22:41:39,329 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 22:41:39,332 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 60 states have (on average 1.2666666666666666) internal successors, (76), 61 states have internal predecessors, (76), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-07-13 22:41:39,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-13 22:41:39,340 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:41:39,341 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2022-07-13 22:41:39,341 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:41:39,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:41:39,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1865164224, now seen corresponding path program 1 times [2022-07-13 22:41:39,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:41:39,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078654615] [2022-07-13 22:41:39,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:41:39,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:41:39,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:39,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:41:39,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:39,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:41:39,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:39,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 22:41:39,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:39,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:41:39,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:39,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 22:41:39,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:39,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 22:41:39,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:39,944 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-13 22:41:39,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:41:39,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078654615] [2022-07-13 22:41:39,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078654615] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:41:39,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:41:39,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 22:41:39,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501841491] [2022-07-13 22:41:39,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:41:39,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 22:41:39,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:41:39,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 22:41:39,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 22:41:39,996 INFO L87 Difference]: Start difference. First operand has 90 states, 60 states have (on average 1.2666666666666666) internal successors, (76), 61 states have internal predecessors, (76), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-13 22:41:40,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:41:40,024 INFO L93 Difference]: Finished difference Result 170 states and 243 transitions. [2022-07-13 22:41:40,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 22:41:40,026 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 47 [2022-07-13 22:41:40,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:41:40,037 INFO L225 Difference]: With dead ends: 170 [2022-07-13 22:41:40,038 INFO L226 Difference]: Without dead ends: 80 [2022-07-13 22:41:40,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 22:41:40,045 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:41:40,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 22:41:40,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-07-13 22:41:40,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-07-13 22:41:40,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 52 states have (on average 1.2307692307692308) internal successors, (64), 54 states have internal predecessors, (64), 22 states have call successors, (22), 6 states have call predecessors, (22), 5 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-07-13 22:41:40,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 105 transitions. [2022-07-13 22:41:40,085 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 105 transitions. Word has length 47 [2022-07-13 22:41:40,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:41:40,086 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 105 transitions. [2022-07-13 22:41:40,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-13 22:41:40,087 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 105 transitions. [2022-07-13 22:41:40,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-13 22:41:40,089 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:41:40,089 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2022-07-13 22:41:40,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 22:41:40,089 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:41:40,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:41:40,090 INFO L85 PathProgramCache]: Analyzing trace with hash 866728124, now seen corresponding path program 1 times [2022-07-13 22:41:40,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:41:40,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033500868] [2022-07-13 22:41:40,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:41:40,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:41:40,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:40,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:41:40,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:40,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:41:40,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:40,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 22:41:40,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:40,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:41:40,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:40,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 22:41:40,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:40,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 22:41:40,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:40,395 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-13 22:41:40,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:41:40,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033500868] [2022-07-13 22:41:40,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033500868] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:41:40,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76201506] [2022-07-13 22:41:40,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:41:40,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:41:40,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:41:40,403 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-13 22:41:40,436 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-13 22:41:40,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:40,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 2490 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 22:41:40,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:41:41,080 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 22:41:41,081 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:41:41,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [76201506] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:41:41,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:41:41,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2022-07-13 22:41:41,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980052303] [2022-07-13 22:41:41,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:41:41,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 22:41:41,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:41:41,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 22:41:41,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-13 22:41:41,086 INFO L87 Difference]: Start difference. First operand 80 states and 105 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-13 22:41:41,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:41:41,265 INFO L93 Difference]: Finished difference Result 146 states and 197 transitions. [2022-07-13 22:41:41,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 22:41:41,266 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 47 [2022-07-13 22:41:41,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:41:41,268 INFO L225 Difference]: With dead ends: 146 [2022-07-13 22:41:41,268 INFO L226 Difference]: Without dead ends: 83 [2022-07-13 22:41:41,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-07-13 22:41:41,270 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 128 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:41:41,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 258 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 22:41:41,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-07-13 22:41:41,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-07-13 22:41:41,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 54 states have (on average 1.2222222222222223) internal successors, (66), 57 states have internal predecessors, (66), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (23), 19 states have call predecessors, (23), 19 states have call successors, (23) [2022-07-13 22:41:41,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 111 transitions. [2022-07-13 22:41:41,293 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 111 transitions. Word has length 47 [2022-07-13 22:41:41,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:41:41,293 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 111 transitions. [2022-07-13 22:41:41,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-13 22:41:41,294 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 111 transitions. [2022-07-13 22:41:41,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-13 22:41:41,300 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:41:41,300 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2022-07-13 22:41:41,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-13 22:41:41,522 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-13 22:41:41,523 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:41:41,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:41:41,524 INFO L85 PathProgramCache]: Analyzing trace with hash -912055711, now seen corresponding path program 1 times [2022-07-13 22:41:41,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:41:41,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888990644] [2022-07-13 22:41:41,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:41:41,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:41:41,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:41,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:41:41,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:41,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:41:41,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:41,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 22:41:41,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:41,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 22:41:41,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:41,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-13 22:41:41,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:41,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 22:41:41,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:41,795 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-13 22:41:41,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:41:41,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888990644] [2022-07-13 22:41:41,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888990644] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:41:41,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22584067] [2022-07-13 22:41:41,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:41:41,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:41:41,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:41:41,804 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-13 22:41:41,805 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-13 22:41:42,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:42,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 2495 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 22:41:42,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:41:42,348 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 22:41:42,348 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:41:42,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [22584067] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:41:42,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:41:42,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2022-07-13 22:41:42,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070499247] [2022-07-13 22:41:42,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:41:42,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 22:41:42,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:41:42,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 22:41:42,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-07-13 22:41:42,350 INFO L87 Difference]: Start difference. First operand 83 states and 111 transitions. Second operand has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-13 22:41:42,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:41:42,519 INFO L93 Difference]: Finished difference Result 141 states and 189 transitions. [2022-07-13 22:41:42,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 22:41:42,520 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 49 [2022-07-13 22:41:42,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:41:42,521 INFO L225 Difference]: With dead ends: 141 [2022-07-13 22:41:42,521 INFO L226 Difference]: Without dead ends: 83 [2022-07-13 22:41:42,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2022-07-13 22:41:42,523 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 145 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:41:42,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 251 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 22:41:42,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-07-13 22:41:42,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-07-13 22:41:42,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 54 states have (on average 1.2222222222222223) internal successors, (66), 57 states have internal predecessors, (66), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (21), 19 states have call predecessors, (21), 19 states have call successors, (21) [2022-07-13 22:41:42,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 109 transitions. [2022-07-13 22:41:42,532 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 109 transitions. Word has length 49 [2022-07-13 22:41:42,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:41:42,532 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 109 transitions. [2022-07-13 22:41:42,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-13 22:41:42,533 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 109 transitions. [2022-07-13 22:41:42,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-13 22:41:42,533 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:41:42,534 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2022-07-13 22:41:42,560 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-13 22:41:42,747 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-13 22:41:42,747 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:41:42,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:41:42,748 INFO L85 PathProgramCache]: Analyzing trace with hash -633300053, now seen corresponding path program 1 times [2022-07-13 22:41:42,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:41:42,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142027698] [2022-07-13 22:41:42,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:41:42,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:41:42,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:42,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:41:42,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:42,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:41:42,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:42,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 22:41:42,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:43,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 22:41:43,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:43,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:41:43,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:43,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 22:41:43,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:43,050 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-13 22:41:43,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:41:43,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142027698] [2022-07-13 22:41:43,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142027698] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:41:43,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:41:43,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 22:41:43,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135866974] [2022-07-13 22:41:43,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:41:43,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 22:41:43,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:41:43,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 22:41:43,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 22:41:43,053 INFO L87 Difference]: Start difference. First operand 83 states and 109 transitions. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-13 22:41:43,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:41:43,130 INFO L93 Difference]: Finished difference Result 95 states and 125 transitions. [2022-07-13 22:41:43,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 22:41:43,131 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 53 [2022-07-13 22:41:43,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:41:43,134 INFO L225 Difference]: With dead ends: 95 [2022-07-13 22:41:43,134 INFO L226 Difference]: Without dead ends: 93 [2022-07-13 22:41:43,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-13 22:41:43,138 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 16 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:41:43,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 691 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 22:41:43,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-07-13 22:41:43,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2022-07-13 22:41:43,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 60 states have (on average 1.2) internal successors, (72), 64 states have internal predecessors, (72), 23 states have call successors, (23), 7 states have call predecessors, (23), 8 states have return successors, (27), 20 states have call predecessors, (27), 20 states have call successors, (27) [2022-07-13 22:41:43,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 122 transitions. [2022-07-13 22:41:43,162 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 122 transitions. Word has length 53 [2022-07-13 22:41:43,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:41:43,162 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 122 transitions. [2022-07-13 22:41:43,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-13 22:41:43,163 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 122 transitions. [2022-07-13 22:41:43,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-13 22:41:43,165 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:41:43,166 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2022-07-13 22:41:43,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 22:41:43,166 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:41:43,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:41:43,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1847539699, now seen corresponding path program 1 times [2022-07-13 22:41:43,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:41:43,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326976717] [2022-07-13 22:41:43,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:41:43,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:41:43,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:43,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:41:43,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:43,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:41:43,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:43,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 22:41:43,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:43,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 22:41:43,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:43,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:41:43,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:43,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 22:41:43,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:43,819 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-13 22:41:43,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:41:43,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326976717] [2022-07-13 22:41:43,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326976717] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:41:43,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636615067] [2022-07-13 22:41:43,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:41:43,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:41:43,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:41:43,824 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-13 22:41:43,853 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-13 22:41:44,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:44,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 2517 conjuncts, 66 conjunts are in the unsatisfiable core [2022-07-13 22:41:44,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:41:44,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-07-13 22:41:44,828 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-13 22:41:44,829 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2022-07-13 22:41:44,933 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-07-13 22:41:44,934 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-07-13 22:41:45,390 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-13 22:41:45,391 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-13 22:41:45,443 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-13 22:41:45,751 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 22:41:45,752 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:41:45,973 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_270 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base| v_ArrVal_270) |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base|) |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.offset|))) (<= .cse0 (* 18446744073709551616 (div .cse0 18446744073709551616))))) is different from false [2022-07-13 22:41:46,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636615067] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:41:46,102 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 22:41:46,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 33 [2022-07-13 22:41:46,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456226621] [2022-07-13 22:41:46,103 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 22:41:46,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-13 22:41:46,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:41:46,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-13 22:41:46,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1107, Unknown=1, NotChecked=68, Total=1332 [2022-07-13 22:41:46,106 INFO L87 Difference]: Start difference. First operand 92 states and 122 transitions. Second operand has 33 states, 30 states have (on average 2.6666666666666665) internal successors, (80), 30 states have internal predecessors, (80), 10 states have call successors, (13), 6 states have call predecessors, (13), 8 states have return successors, (12), 7 states have call predecessors, (12), 9 states have call successors, (12) [2022-07-13 22:41:47,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:41:47,539 INFO L93 Difference]: Finished difference Result 261 states and 360 transitions. [2022-07-13 22:41:47,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-07-13 22:41:47,540 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 2.6666666666666665) internal successors, (80), 30 states have internal predecessors, (80), 10 states have call successors, (13), 6 states have call predecessors, (13), 8 states have return successors, (12), 7 states have call predecessors, (12), 9 states have call successors, (12) Word has length 57 [2022-07-13 22:41:47,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:41:47,545 INFO L225 Difference]: With dead ends: 261 [2022-07-13 22:41:47,546 INFO L226 Difference]: Without dead ends: 196 [2022-07-13 22:41:47,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 69 SyntacticMatches, 8 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 851 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=299, Invalid=2154, Unknown=1, NotChecked=96, Total=2550 [2022-07-13 22:41:47,547 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 127 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 1140 SdHoareTripleChecker+Invalid, 1335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 465 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-13 22:41:47,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 1140 Invalid, 1335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 826 Invalid, 0 Unknown, 465 Unchecked, 0.9s Time] [2022-07-13 22:41:47,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-07-13 22:41:47,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 156. [2022-07-13 22:41:47,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 108 states have (on average 1.2222222222222223) internal successors, (132), 111 states have internal predecessors, (132), 34 states have call successors, (34), 13 states have call predecessors, (34), 13 states have return successors, (42), 31 states have call predecessors, (42), 31 states have call successors, (42) [2022-07-13 22:41:47,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 208 transitions. [2022-07-13 22:41:47,591 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 208 transitions. Word has length 57 [2022-07-13 22:41:47,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:41:47,592 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 208 transitions. [2022-07-13 22:41:47,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 2.6666666666666665) internal successors, (80), 30 states have internal predecessors, (80), 10 states have call successors, (13), 6 states have call predecessors, (13), 8 states have return successors, (12), 7 states have call predecessors, (12), 9 states have call successors, (12) [2022-07-13 22:41:47,592 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 208 transitions. [2022-07-13 22:41:47,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-13 22:41:47,596 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:41:47,596 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2022-07-13 22:41:47,626 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-13 22:41:47,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:41:47,813 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:41:47,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:41:47,813 INFO L85 PathProgramCache]: Analyzing trace with hash 259191797, now seen corresponding path program 1 times [2022-07-13 22:41:47,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:41:47,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366400092] [2022-07-13 22:41:47,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:41:47,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:41:47,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:48,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:41:48,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:48,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:41:48,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:48,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 22:41:48,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:48,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 22:41:48,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:48,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:41:48,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:48,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 22:41:48,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:48,587 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-13 22:41:48,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:41:48,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366400092] [2022-07-13 22:41:48,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366400092] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:41:48,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739914106] [2022-07-13 22:41:48,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:41:48,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:41:48,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:41:48,589 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-13 22:41:48,591 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-13 22:41:53,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:41:53,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 2547 conjuncts, 80 conjunts are in the unsatisfiable core [2022-07-13 22:41:53,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:41:53,975 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-07-13 22:41:54,401 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-13 22:41:54,401 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2022-07-13 22:41:54,500 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-07-13 22:41:54,500 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-07-13 22:41:54,905 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-13 22:41:54,906 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-13 22:41:55,023 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 57 treesize of output 46 [2022-07-13 22:41:55,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:41:55,034 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 54 treesize of output 47 [2022-07-13 22:41:55,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:41:55,041 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 43 [2022-07-13 22:41:55,718 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 22:41:55,718 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:41:55,943 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 22:41:55,944 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-07-13 22:41:55,952 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.offset| Int)) (or (not (= (select v_arrayElimArr_2 |ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.offset|) |c_ULTIMATE.start_aws_byte_cursor_advance_~len#1|)) (<= |c_ULTIMATE.start_aws_byte_cursor_advance_~len#1| (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base|) |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.offset|))) (+ (* (div (+ |c_ULTIMATE.start_aws_byte_cursor_advance_~len#1| (* (- 1) .cse0)) 18446744073709551616) 18446744073709551616) .cse0))))) |c_ULTIMATE.start_aws_byte_cursor_advance_#t~short1082#1|) is different from false [2022-07-13 22:41:55,970 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_2 (Array Int Int)) (|ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_2 |ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.offset|))) (or (< (mod (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base|) |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.offset|) 18446744073709551616) (mod .cse0 18446744073709551616)) (<= .cse0 (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base| v_arrayElimArr_2) |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base|) |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.offset|))) (+ (* 18446744073709551616 (div (+ .cse0 (* (- 1) .cse1)) 18446744073709551616)) .cse1)))))) is different from false [2022-07-13 22:41:56,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [739914106] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:41:56,096 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 22:41:56,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 33 [2022-07-13 22:41:56,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755350840] [2022-07-13 22:41:56,096 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 22:41:56,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-13 22:41:56,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:41:56,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-13 22:41:56,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1122, Unknown=2, NotChecked=138, Total=1406 [2022-07-13 22:41:56,098 INFO L87 Difference]: Start difference. First operand 156 states and 208 transitions. Second operand has 33 states, 30 states have (on average 2.6666666666666665) internal successors, (80), 30 states have internal predecessors, (80), 10 states have call successors, (13), 6 states have call predecessors, (13), 8 states have return successors, (12), 7 states have call predecessors, (12), 9 states have call successors, (12) [2022-07-13 22:42:00,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:42:00,527 INFO L93 Difference]: Finished difference Result 313 states and 449 transitions. [2022-07-13 22:42:00,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-13 22:42:00,528 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 2.6666666666666665) internal successors, (80), 30 states have internal predecessors, (80), 10 states have call successors, (13), 6 states have call predecessors, (13), 8 states have return successors, (12), 7 states have call predecessors, (12), 9 states have call successors, (12) Word has length 57 [2022-07-13 22:42:00,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:42:00,530 INFO L225 Difference]: With dead ends: 313 [2022-07-13 22:42:00,530 INFO L226 Difference]: Without dead ends: 244 [2022-07-13 22:42:00,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 66 SyntacticMatches, 10 SemanticMatches, 54 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1002 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=304, Invalid=2563, Unknown=3, NotChecked=210, Total=3080 [2022-07-13 22:42:00,532 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 121 mSDsluCounter, 1448 mSDsCounter, 0 mSdLazyCounter, 1021 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 1609 SdHoareTripleChecker+Invalid, 1564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 459 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-13 22:42:00,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 1609 Invalid, 1564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1021 Invalid, 0 Unknown, 459 Unchecked, 1.3s Time] [2022-07-13 22:42:00,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-07-13 22:42:00,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 170. [2022-07-13 22:42:00,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 118 states have (on average 1.228813559322034) internal successors, (145), 121 states have internal predecessors, (145), 38 states have call successors, (38), 14 states have call predecessors, (38), 13 states have return successors, (47), 34 states have call predecessors, (47), 35 states have call successors, (47) [2022-07-13 22:42:00,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 230 transitions. [2022-07-13 22:42:00,554 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 230 transitions. Word has length 57 [2022-07-13 22:42:00,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:42:00,554 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 230 transitions. [2022-07-13 22:42:00,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 2.6666666666666665) internal successors, (80), 30 states have internal predecessors, (80), 10 states have call successors, (13), 6 states have call predecessors, (13), 8 states have return successors, (12), 7 states have call predecessors, (12), 9 states have call successors, (12) [2022-07-13 22:42:00,555 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 230 transitions. [2022-07-13 22:42:00,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-13 22:42:00,556 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:42:00,556 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-07-13 22:42:00,592 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-13 22:42:00,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:42:00,783 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:42:00,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:42:00,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1565075525, now seen corresponding path program 2 times [2022-07-13 22:42:00,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:42:00,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824759569] [2022-07-13 22:42:00,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:42:00,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:42:00,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:00,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:42:00,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:00,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:42:00,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:00,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 22:42:00,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:00,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 22:42:00,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:01,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 22:42:01,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:01,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:42:01,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:01,052 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-13 22:42:01,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:42:01,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824759569] [2022-07-13 22:42:01,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824759569] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:42:01,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793179867] [2022-07-13 22:42:01,053 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 22:42:01,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:42:01,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:42:01,055 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-13 22:42:01,056 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-13 22:42:01,713 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 22:42:01,713 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 22:42:01,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 2529 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-13 22:42:01,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:42:01,783 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 22:42:01,784 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:42:01,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1793179867] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:42:01,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:42:01,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 10 [2022-07-13 22:42:01,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679306997] [2022-07-13 22:42:01,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:42:01,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 22:42:01,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:42:01,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 22:42:01,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-13 22:42:01,786 INFO L87 Difference]: Start difference. First operand 170 states and 230 transitions. Second operand has 9 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-13 22:42:01,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:42:01,910 INFO L93 Difference]: Finished difference Result 238 states and 327 transitions. [2022-07-13 22:42:01,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 22:42:01,910 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 61 [2022-07-13 22:42:01,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:42:01,917 INFO L225 Difference]: With dead ends: 238 [2022-07-13 22:42:01,917 INFO L226 Difference]: Without dead ends: 170 [2022-07-13 22:42:01,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-07-13 22:42:01,918 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 12 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:42:01,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 779 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 22:42:01,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-07-13 22:42:01,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2022-07-13 22:42:01,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 118 states have (on average 1.2203389830508475) internal successors, (144), 121 states have internal predecessors, (144), 38 states have call successors, (38), 14 states have call predecessors, (38), 13 states have return successors, (51), 34 states have call predecessors, (51), 35 states have call successors, (51) [2022-07-13 22:42:01,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 233 transitions. [2022-07-13 22:42:01,947 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 233 transitions. Word has length 61 [2022-07-13 22:42:01,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:42:01,947 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 233 transitions. [2022-07-13 22:42:01,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-13 22:42:01,948 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 233 transitions. [2022-07-13 22:42:01,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-13 22:42:01,949 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:42:01,949 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-13 22:42:01,980 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-13 22:42:02,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:42:02,176 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:42:02,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:42:02,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1300919918, now seen corresponding path program 1 times [2022-07-13 22:42:02,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:42:02,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432754019] [2022-07-13 22:42:02,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:42:02,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:42:02,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:02,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:42:02,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:02,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:42:02,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:02,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 22:42:02,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:02,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 22:42:02,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:02,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 22:42:02,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:02,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 22:42:02,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:02,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-13 22:42:02,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:02,511 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-13 22:42:02,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:42:02,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432754019] [2022-07-13 22:42:02,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432754019] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:42:02,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:42:02,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 22:42:02,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309095383] [2022-07-13 22:42:02,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:42:02,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 22:42:02,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:42:02,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 22:42:02,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 22:42:02,518 INFO L87 Difference]: Start difference. First operand 170 states and 233 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 22:42:02,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:42:02,769 INFO L93 Difference]: Finished difference Result 288 states and 411 transitions. [2022-07-13 22:42:02,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 22:42:02,769 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 64 [2022-07-13 22:42:02,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:42:02,771 INFO L225 Difference]: With dead ends: 288 [2022-07-13 22:42:02,771 INFO L226 Difference]: Without dead ends: 199 [2022-07-13 22:42:02,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-07-13 22:42:02,773 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 38 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 22:42:02,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 473 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 22:42:02,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-07-13 22:42:02,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 162. [2022-07-13 22:42:02,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 113 states have (on average 1.2123893805309736) internal successors, (137), 115 states have internal predecessors, (137), 35 states have call successors, (35), 14 states have call predecessors, (35), 13 states have return successors, (47), 32 states have call predecessors, (47), 32 states have call successors, (47) [2022-07-13 22:42:02,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 219 transitions. [2022-07-13 22:42:02,789 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 219 transitions. Word has length 64 [2022-07-13 22:42:02,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:42:02,790 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 219 transitions. [2022-07-13 22:42:02,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 22:42:02,790 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 219 transitions. [2022-07-13 22:42:02,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-13 22:42:02,791 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:42:02,791 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-07-13 22:42:02,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 22:42:02,792 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:42:02,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:42:02,792 INFO L85 PathProgramCache]: Analyzing trace with hash -145583488, now seen corresponding path program 1 times [2022-07-13 22:42:02,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:42:02,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587497641] [2022-07-13 22:42:02,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:42:02,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:42:02,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:02,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:42:02,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:02,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:42:02,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:02,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 22:42:02,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:02,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 22:42:02,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:02,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 22:42:02,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:02,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 22:42:02,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:02,975 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-13 22:42:02,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:42:02,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587497641] [2022-07-13 22:42:02,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587497641] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:42:02,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307032074] [2022-07-13 22:42:02,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:42:02,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:42:02,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:42:02,977 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-13 22:42:02,978 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-13 22:42:03,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:03,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 2534 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 22:42:03,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:42:03,448 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-13 22:42:03,449 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:42:03,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1307032074] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:42:03,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:42:03,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-07-13 22:42:03,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978129498] [2022-07-13 22:42:03,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:42:03,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 22:42:03,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:42:03,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 22:42:03,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-13 22:42:03,451 INFO L87 Difference]: Start difference. First operand 162 states and 219 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-13 22:42:03,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:42:03,623 INFO L93 Difference]: Finished difference Result 258 states and 361 transitions. [2022-07-13 22:42:03,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 22:42:03,624 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 63 [2022-07-13 22:42:03,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:42:03,625 INFO L225 Difference]: With dead ends: 258 [2022-07-13 22:42:03,625 INFO L226 Difference]: Without dead ends: 162 [2022-07-13 22:42:03,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-13 22:42:03,627 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 15 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 32 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:42:03,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 330 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 32 Unchecked, 0.1s Time] [2022-07-13 22:42:03,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-07-13 22:42:03,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2022-07-13 22:42:03,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 113 states have (on average 1.2035398230088497) internal successors, (136), 115 states have internal predecessors, (136), 35 states have call successors, (35), 14 states have call predecessors, (35), 13 states have return successors, (47), 32 states have call predecessors, (47), 32 states have call successors, (47) [2022-07-13 22:42:03,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 218 transitions. [2022-07-13 22:42:03,641 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 218 transitions. Word has length 63 [2022-07-13 22:42:03,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:42:03,642 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 218 transitions. [2022-07-13 22:42:03,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-13 22:42:03,642 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 218 transitions. [2022-07-13 22:42:03,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-13 22:42:03,643 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:42:03,643 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-07-13 22:42:03,667 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-13 22:42:03,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:42:03,856 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:42:03,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:42:03,856 INFO L85 PathProgramCache]: Analyzing trace with hash 556016386, now seen corresponding path program 1 times [2022-07-13 22:42:03,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:42:03,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537495460] [2022-07-13 22:42:03,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:42:03,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:42:04,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:04,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:42:04,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:04,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:42:04,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:04,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 22:42:04,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:04,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 22:42:04,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:04,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 22:42:04,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:04,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 22:42:04,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:04,582 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-13 22:42:04,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:42:04,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537495460] [2022-07-13 22:42:04,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537495460] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:42:04,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834698756] [2022-07-13 22:42:04,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:42:04,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:42:04,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:42:04,611 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-13 22:42:04,616 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-13 22:42:05,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:05,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 2539 conjuncts, 51 conjunts are in the unsatisfiable core [2022-07-13 22:42:05,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:42:05,048 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 6 treesize of output 5 [2022-07-13 22:42:05,446 INFO L356 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-07-13 22:42:05,446 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 1 [2022-07-13 22:42:05,449 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 25 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 22:42:05,449 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:42:05,759 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-13 22:42:05,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1834698756] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:42:05,760 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:42:05,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 10] total 30 [2022-07-13 22:42:05,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715313455] [2022-07-13 22:42:05,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:42:05,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-13 22:42:05,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:42:05,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-13 22:42:05,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=766, Unknown=0, NotChecked=0, Total=870 [2022-07-13 22:42:05,761 INFO L87 Difference]: Start difference. First operand 162 states and 218 transitions. Second operand has 30 states, 27 states have (on average 3.8518518518518516) internal successors, (104), 30 states have internal predecessors, (104), 9 states have call successors, (16), 3 states have call predecessors, (16), 7 states have return successors, (16), 6 states have call predecessors, (16), 9 states have call successors, (16) [2022-07-13 22:42:08,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:42:08,980 INFO L93 Difference]: Finished difference Result 348 states and 497 transitions. [2022-07-13 22:42:08,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-07-13 22:42:08,986 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 3.8518518518518516) internal successors, (104), 30 states have internal predecessors, (104), 9 states have call successors, (16), 3 states have call predecessors, (16), 7 states have return successors, (16), 6 states have call predecessors, (16), 9 states have call successors, (16) Word has length 63 [2022-07-13 22:42:08,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:42:08,988 INFO L225 Difference]: With dead ends: 348 [2022-07-13 22:42:08,988 INFO L226 Difference]: Without dead ends: 245 [2022-07-13 22:42:08,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 125 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 927 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=524, Invalid=3016, Unknown=0, NotChecked=0, Total=3540 [2022-07-13 22:42:08,990 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 295 mSDsluCounter, 934 mSDsCounter, 0 mSdLazyCounter, 1942 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 1068 SdHoareTripleChecker+Invalid, 2282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 1942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 200 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-13 22:42:08,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 1068 Invalid, 2282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 1942 Invalid, 0 Unknown, 200 Unchecked, 1.9s Time] [2022-07-13 22:42:08,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2022-07-13 22:42:09,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 161. [2022-07-13 22:42:09,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 111 states have (on average 1.1711711711711712) internal successors, (130), 114 states have internal predecessors, (130), 35 states have call successors, (35), 14 states have call predecessors, (35), 14 states have return successors, (45), 32 states have call predecessors, (45), 32 states have call successors, (45) [2022-07-13 22:42:09,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 210 transitions. [2022-07-13 22:42:09,015 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 210 transitions. Word has length 63 [2022-07-13 22:42:09,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:42:09,015 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 210 transitions. [2022-07-13 22:42:09,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 3.8518518518518516) internal successors, (104), 30 states have internal predecessors, (104), 9 states have call successors, (16), 3 states have call predecessors, (16), 7 states have return successors, (16), 6 states have call predecessors, (16), 9 states have call successors, (16) [2022-07-13 22:42:09,015 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 210 transitions. [2022-07-13 22:42:09,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-13 22:42:09,019 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:42:09,019 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 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] [2022-07-13 22:42:09,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-07-13 22:42:09,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:42:09,245 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:42:09,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:42:09,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1118956732, now seen corresponding path program 1 times [2022-07-13 22:42:09,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:42:09,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163632470] [2022-07-13 22:42:09,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:42:09,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:42:09,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:09,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:42:09,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:09,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:42:09,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:09,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 22:42:09,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:09,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 22:42:09,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:09,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:42:09,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:09,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 22:42:09,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:09,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 22:42:09,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:09,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-13 22:42:09,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:09,472 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-13 22:42:09,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:42:09,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163632470] [2022-07-13 22:42:09,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163632470] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:42:09,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:42:09,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 22:42:09,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957600086] [2022-07-13 22:42:09,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:42:09,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 22:42:09,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:42:09,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 22:42:09,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 22:42:09,475 INFO L87 Difference]: Start difference. First operand 161 states and 210 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 22:42:09,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:42:09,530 INFO L93 Difference]: Finished difference Result 216 states and 277 transitions. [2022-07-13 22:42:09,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 22:42:09,530 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 65 [2022-07-13 22:42:09,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:42:09,532 INFO L225 Difference]: With dead ends: 216 [2022-07-13 22:42:09,532 INFO L226 Difference]: Without dead ends: 161 [2022-07-13 22:42:09,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 22:42:09,533 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 16 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:42:09,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 362 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 22:42:09,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-07-13 22:42:09,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2022-07-13 22:42:09,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 111 states have (on average 1.1711711711711712) internal successors, (130), 114 states have internal predecessors, (130), 35 states have call successors, (35), 14 states have call predecessors, (35), 14 states have return successors, (44), 32 states have call predecessors, (44), 32 states have call successors, (44) [2022-07-13 22:42:09,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 209 transitions. [2022-07-13 22:42:09,549 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 209 transitions. Word has length 65 [2022-07-13 22:42:09,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:42:09,550 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 209 transitions. [2022-07-13 22:42:09,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 22:42:09,551 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 209 transitions. [2022-07-13 22:42:09,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-13 22:42:09,553 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:42:09,554 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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] [2022-07-13 22:42:09,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-13 22:42:09,554 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:42:09,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:42:09,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1635963807, now seen corresponding path program 1 times [2022-07-13 22:42:09,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:42:09,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885532130] [2022-07-13 22:42:09,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:42:09,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:42:09,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:09,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:42:09,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:09,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:42:09,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:09,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 22:42:09,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:09,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 22:42:09,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:09,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:42:09,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:09,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 22:42:09,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:09,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 22:42:09,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:09,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-13 22:42:09,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:09,756 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-13 22:42:09,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:42:09,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885532130] [2022-07-13 22:42:09,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885532130] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:42:09,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:42:09,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 22:42:09,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547654942] [2022-07-13 22:42:09,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:42:09,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 22:42:09,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:42:09,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 22:42:09,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 22:42:09,759 INFO L87 Difference]: Start difference. First operand 161 states and 209 transitions. Second operand has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-07-13 22:42:09,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:42:09,831 INFO L93 Difference]: Finished difference Result 169 states and 217 transitions. [2022-07-13 22:42:09,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 22:42:09,832 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 67 [2022-07-13 22:42:09,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:42:09,834 INFO L225 Difference]: With dead ends: 169 [2022-07-13 22:42:09,834 INFO L226 Difference]: Without dead ends: 167 [2022-07-13 22:42:09,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-13 22:42:09,835 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 15 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:42:09,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 683 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 22:42:09,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-07-13 22:42:09,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 166. [2022-07-13 22:42:09,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 114 states have (on average 1.1666666666666667) internal successors, (133), 117 states have internal predecessors, (133), 36 states have call successors, (36), 15 states have call predecessors, (36), 15 states have return successors, (45), 33 states have call predecessors, (45), 33 states have call successors, (45) [2022-07-13 22:42:09,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 214 transitions. [2022-07-13 22:42:09,854 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 214 transitions. Word has length 67 [2022-07-13 22:42:09,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:42:09,854 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 214 transitions. [2022-07-13 22:42:09,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-07-13 22:42:09,855 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 214 transitions. [2022-07-13 22:42:09,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-13 22:42:09,856 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:42:09,857 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-13 22:42:09,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-13 22:42:09,857 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:42:09,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:42:09,857 INFO L85 PathProgramCache]: Analyzing trace with hash 701340153, now seen corresponding path program 1 times [2022-07-13 22:42:09,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:42:09,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129100003] [2022-07-13 22:42:09,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:42:09,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:42:09,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:10,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:42:10,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:10,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:42:10,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:10,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:42:10,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:10,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 22:42:10,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:10,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-13 22:42:10,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:10,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 22:42:10,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:10,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-13 22:42:10,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:10,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-13 22:42:10,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:10,386 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-13 22:42:10,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:42:10,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129100003] [2022-07-13 22:42:10,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129100003] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:42:10,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257598292] [2022-07-13 22:42:10,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:42:10,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:42:10,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:42:10,392 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-13 22:42:10,393 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-13 22:42:10,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:10,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 2554 conjuncts, 69 conjunts are in the unsatisfiable core [2022-07-13 22:42:10,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:42:10,835 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-07-13 22:42:11,001 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-13 22:42:11,002 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-13 22:42:11,080 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 22:42:13,512 INFO L356 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2022-07-13 22:42:13,512 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 30 [2022-07-13 22:42:13,575 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-13 22:42:13,575 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-13 22:42:15,893 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 22:42:15,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 11 [2022-07-13 22:42:15,931 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 23 treesize of output 23 [2022-07-13 22:42:21,671 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-13 22:42:21,671 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:42:21,865 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_778 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base| v_ArrVal_778) |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base|) (+ |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.offset| 8)) 0))) is different from false [2022-07-13 22:42:21,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257598292] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:42:21,930 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 22:42:21,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 34 [2022-07-13 22:42:21,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467026231] [2022-07-13 22:42:21,931 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 22:42:21,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-13 22:42:21,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:42:21,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-13 22:42:21,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1411, Unknown=3, NotChecked=76, Total=1640 [2022-07-13 22:42:21,932 INFO L87 Difference]: Start difference. First operand 166 states and 214 transitions. Second operand has 34 states, 31 states have (on average 2.6129032258064515) internal successors, (81), 30 states have internal predecessors, (81), 12 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (16), 10 states have call predecessors, (16), 11 states have call successors, (16) [2022-07-13 22:42:43,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:42:43,513 INFO L93 Difference]: Finished difference Result 417 states and 585 transitions. [2022-07-13 22:42:43,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-07-13 22:42:43,514 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 31 states have (on average 2.6129032258064515) internal successors, (81), 30 states have internal predecessors, (81), 12 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (16), 10 states have call predecessors, (16), 11 states have call successors, (16) Word has length 68 [2022-07-13 22:42:43,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:42:43,516 INFO L225 Difference]: With dead ends: 417 [2022-07-13 22:42:43,516 INFO L226 Difference]: Without dead ends: 345 [2022-07-13 22:42:43,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 83 SyntacticMatches, 14 SemanticMatches, 87 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2347 ImplicationChecksByTransitivity, 30.3s TimeCoverageRelationStatistics Valid=809, Invalid=6845, Unknown=6, NotChecked=172, Total=7832 [2022-07-13 22:42:43,519 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 503 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 2354 mSolverCounterSat, 524 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 4051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 524 IncrementalHoareTripleChecker+Valid, 2354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1173 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-13 22:42:43,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 494 Invalid, 4051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [524 Valid, 2354 Invalid, 0 Unknown, 1173 Unchecked, 1.9s Time] [2022-07-13 22:42:43,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2022-07-13 22:42:43,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 193. [2022-07-13 22:42:43,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 137 states have (on average 1.1605839416058394) internal successors, (159), 140 states have internal predecessors, (159), 37 states have call successors, (37), 19 states have call predecessors, (37), 18 states have return successors, (45), 33 states have call predecessors, (45), 34 states have call successors, (45) [2022-07-13 22:42:43,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 241 transitions. [2022-07-13 22:42:43,541 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 241 transitions. Word has length 68 [2022-07-13 22:42:43,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:42:43,541 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 241 transitions. [2022-07-13 22:42:43,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 31 states have (on average 2.6129032258064515) internal successors, (81), 30 states have internal predecessors, (81), 12 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (16), 10 states have call predecessors, (16), 11 states have call successors, (16) [2022-07-13 22:42:43,542 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 241 transitions. [2022-07-13 22:42:43,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-13 22:42:43,543 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:42:43,543 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 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] [2022-07-13 22:42:43,572 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-13 22:42:43,763 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,SelfDestructingSolverStorable12 [2022-07-13 22:42:43,764 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:42:43,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:42:43,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1153679959, now seen corresponding path program 1 times [2022-07-13 22:42:43,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:42:43,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840453269] [2022-07-13 22:42:43,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:42:43,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:42:43,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:43,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:42:43,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:43,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:42:43,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:43,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 22:42:43,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:43,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 22:42:43,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:43,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:42:43,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:43,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 22:42:43,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:43,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 22:42:43,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:43,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-13 22:42:43,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:43,969 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-13 22:42:43,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:42:43,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840453269] [2022-07-13 22:42:43,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840453269] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:42:43,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:42:43,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 22:42:43,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174260629] [2022-07-13 22:42:43,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:42:43,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 22:42:43,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:42:43,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 22:42:43,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-13 22:42:43,971 INFO L87 Difference]: Start difference. First operand 193 states and 241 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 22:42:44,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:42:44,200 INFO L93 Difference]: Finished difference Result 256 states and 326 transitions. [2022-07-13 22:42:44,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 22:42:44,201 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 71 [2022-07-13 22:42:44,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:42:44,202 INFO L225 Difference]: With dead ends: 256 [2022-07-13 22:42:44,202 INFO L226 Difference]: Without dead ends: 201 [2022-07-13 22:42:44,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-13 22:42:44,203 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 32 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 22:42:44,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 377 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 22:42:44,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-07-13 22:42:44,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2022-07-13 22:42:44,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 138 states have (on average 1.1594202898550725) internal successors, (160), 143 states have internal predecessors, (160), 42 states have call successors, (42), 19 states have call predecessors, (42), 18 states have return successors, (52), 36 states have call predecessors, (52), 39 states have call successors, (52) [2022-07-13 22:42:44,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 254 transitions. [2022-07-13 22:42:44,229 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 254 transitions. Word has length 71 [2022-07-13 22:42:44,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:42:44,229 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 254 transitions. [2022-07-13 22:42:44,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 22:42:44,231 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 254 transitions. [2022-07-13 22:42:44,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-13 22:42:44,233 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:42:44,233 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 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] [2022-07-13 22:42:44,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-13 22:42:44,234 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:42:44,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:42:44,234 INFO L85 PathProgramCache]: Analyzing trace with hash -452080085, now seen corresponding path program 1 times [2022-07-13 22:42:44,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:42:44,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144932666] [2022-07-13 22:42:44,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:42:44,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:42:44,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:44,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:42:44,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:44,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:42:44,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:44,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 22:42:44,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:44,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 22:42:44,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:44,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:42:44,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:44,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 22:42:44,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:44,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 22:42:44,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:44,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-13 22:42:44,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:44,773 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 20 proven. 11 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-13 22:42:44,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:42:44,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144932666] [2022-07-13 22:42:44,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144932666] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:42:44,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306042913] [2022-07-13 22:42:44,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:42:44,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:42:44,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:42:44,776 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-13 22:42:44,785 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-13 22:42:45,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:45,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 2579 conjuncts, 71 conjunts are in the unsatisfiable core [2022-07-13 22:42:45,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:42:45,181 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 6 treesize of output 5 [2022-07-13 22:42:45,660 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 22:42:45,660 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 49 treesize of output 36 [2022-07-13 22:42:45,740 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-07-13 22:42:45,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 12 [2022-07-13 22:42:45,764 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 22:42:45,764 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 1 case distinctions, treesize of input 42 treesize of output 44 [2022-07-13 22:42:45,775 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 30 treesize of output 24 [2022-07-13 22:42:46,331 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-13 22:42:46,332 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:42:46,742 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 22:42:46,743 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 42 [2022-07-13 22:42:46,748 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 22:42:46,748 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2022-07-13 22:42:46,752 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 48 treesize of output 36 [2022-07-13 22:42:46,762 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 22:42:46,762 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 28 [2022-07-13 22:42:47,162 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 28 treesize of output 24 [2022-07-13 22:42:47,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 8 treesize of output 6 [2022-07-13 22:42:47,183 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 14 proven. 18 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-13 22:42:47,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1306042913] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:42:47,183 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:42:47,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 16] total 37 [2022-07-13 22:42:47,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412266658] [2022-07-13 22:42:47,183 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:42:47,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-07-13 22:42:47,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:42:47,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-07-13 22:42:47,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1210, Unknown=0, NotChecked=0, Total=1332 [2022-07-13 22:42:47,185 INFO L87 Difference]: Start difference. First operand 199 states and 254 transitions. Second operand has 37 states, 33 states have (on average 2.787878787878788) internal successors, (92), 36 states have internal predecessors, (92), 15 states have call successors, (23), 3 states have call predecessors, (23), 5 states have return successors, (22), 10 states have call predecessors, (22), 14 states have call successors, (22) [2022-07-13 22:42:51,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:42:51,056 INFO L93 Difference]: Finished difference Result 392 states and 541 transitions. [2022-07-13 22:42:51,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-07-13 22:42:51,057 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 33 states have (on average 2.787878787878788) internal successors, (92), 36 states have internal predecessors, (92), 15 states have call successors, (23), 3 states have call predecessors, (23), 5 states have return successors, (22), 10 states have call predecessors, (22), 14 states have call successors, (22) Word has length 71 [2022-07-13 22:42:51,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:42:51,060 INFO L225 Difference]: With dead ends: 392 [2022-07-13 22:42:51,060 INFO L226 Difference]: Without dead ends: 319 [2022-07-13 22:42:51,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 128 SyntacticMatches, 16 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1673 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=587, Invalid=5265, Unknown=0, NotChecked=0, Total=5852 [2022-07-13 22:42:51,062 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 276 mSDsluCounter, 2131 mSDsCounter, 0 mSdLazyCounter, 2769 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 2300 SdHoareTripleChecker+Invalid, 3413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 2769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 359 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-13 22:42:51,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 2300 Invalid, 3413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 2769 Invalid, 0 Unknown, 359 Unchecked, 2.2s Time] [2022-07-13 22:42:51,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-07-13 22:42:51,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 227. [2022-07-13 22:42:51,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 157 states have (on average 1.1656050955414012) internal successors, (183), 165 states have internal predecessors, (183), 48 states have call successors, (48), 21 states have call predecessors, (48), 21 states have return successors, (58), 40 states have call predecessors, (58), 45 states have call successors, (58) [2022-07-13 22:42:51,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 289 transitions. [2022-07-13 22:42:51,093 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 289 transitions. Word has length 71 [2022-07-13 22:42:51,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:42:51,093 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 289 transitions. [2022-07-13 22:42:51,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 33 states have (on average 2.787878787878788) internal successors, (92), 36 states have internal predecessors, (92), 15 states have call successors, (23), 3 states have call predecessors, (23), 5 states have return successors, (22), 10 states have call predecessors, (22), 14 states have call successors, (22) [2022-07-13 22:42:51,094 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 289 transitions. [2022-07-13 22:42:51,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-07-13 22:42:51,095 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:42:51,095 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2022-07-13 22:42:51,125 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-13 22:42:51,312 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,SelfDestructingSolverStorable14 [2022-07-13 22:42:51,312 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:42:51,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:42:51,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1701555945, now seen corresponding path program 1 times [2022-07-13 22:42:51,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:42:51,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511318373] [2022-07-13 22:42:51,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:42:51,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:42:51,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:51,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:42:51,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:51,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:42:51,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:51,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 22:42:51,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:51,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 22:42:51,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:51,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:42:51,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:51,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 22:42:51,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:51,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 22:42:51,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:51,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-13 22:42:51,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:51,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:42:51,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:51,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-13 22:42:51,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:51,506 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-07-13 22:42:51,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:42:51,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511318373] [2022-07-13 22:42:51,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511318373] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:42:51,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:42:51,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 22:42:51,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199917823] [2022-07-13 22:42:51,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:42:51,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 22:42:51,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:42:51,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 22:42:51,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 22:42:51,508 INFO L87 Difference]: Start difference. First operand 227 states and 289 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-13 22:42:51,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:42:51,552 INFO L93 Difference]: Finished difference Result 253 states and 322 transitions. [2022-07-13 22:42:51,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 22:42:51,552 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 80 [2022-07-13 22:42:51,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:42:51,554 INFO L225 Difference]: With dead ends: 253 [2022-07-13 22:42:51,554 INFO L226 Difference]: Without dead ends: 224 [2022-07-13 22:42:51,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 22:42:51,555 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 27 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:42:51,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 257 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 22:42:51,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-07-13 22:42:51,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 222. [2022-07-13 22:42:51,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 153 states have (on average 1.1633986928104576) internal successors, (178), 161 states have internal predecessors, (178), 48 states have call successors, (48), 20 states have call predecessors, (48), 20 states have return successors, (57), 40 states have call predecessors, (57), 45 states have call successors, (57) [2022-07-13 22:42:51,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 283 transitions. [2022-07-13 22:42:51,586 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 283 transitions. Word has length 80 [2022-07-13 22:42:51,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:42:51,586 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 283 transitions. [2022-07-13 22:42:51,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-13 22:42:51,587 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 283 transitions. [2022-07-13 22:42:51,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-13 22:42:51,589 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:42:51,589 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 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] [2022-07-13 22:42:51,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-13 22:42:51,589 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:42:51,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:42:51,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1390033412, now seen corresponding path program 1 times [2022-07-13 22:42:51,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:42:51,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128476482] [2022-07-13 22:42:51,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:42:51,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:42:51,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:51,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:42:51,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:51,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:42:51,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:51,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 22:42:51,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:51,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 22:42:51,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:51,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:42:51,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:51,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 22:42:51,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:51,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 22:42:51,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:51,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-13 22:42:51,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:51,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:42:51,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:51,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-13 22:42:51,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:51,806 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-07-13 22:42:51,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:42:51,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128476482] [2022-07-13 22:42:51,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128476482] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:42:51,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:42:51,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 22:42:51,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517866770] [2022-07-13 22:42:51,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:42:51,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 22:42:51,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:42:51,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 22:42:51,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 22:42:51,809 INFO L87 Difference]: Start difference. First operand 222 states and 283 transitions. Second operand has 8 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-13 22:42:51,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:42:51,897 INFO L93 Difference]: Finished difference Result 230 states and 291 transitions. [2022-07-13 22:42:51,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 22:42:51,897 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 82 [2022-07-13 22:42:51,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:42:51,898 INFO L225 Difference]: With dead ends: 230 [2022-07-13 22:42:51,899 INFO L226 Difference]: Without dead ends: 228 [2022-07-13 22:42:51,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-13 22:42:51,899 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 15 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:42:51,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 670 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 22:42:51,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-07-13 22:42:51,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 227. [2022-07-13 22:42:51,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 156 states have (on average 1.1602564102564104) internal successors, (181), 164 states have internal predecessors, (181), 49 states have call successors, (49), 21 states have call predecessors, (49), 21 states have return successors, (58), 41 states have call predecessors, (58), 46 states have call successors, (58) [2022-07-13 22:42:51,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 288 transitions. [2022-07-13 22:42:51,929 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 288 transitions. Word has length 82 [2022-07-13 22:42:51,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:42:51,929 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 288 transitions. [2022-07-13 22:42:51,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-13 22:42:51,930 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 288 transitions. [2022-07-13 22:42:51,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-13 22:42:51,931 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:42:51,931 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 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] [2022-07-13 22:42:51,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-13 22:42:51,932 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:42:51,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:42:51,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1172549180, now seen corresponding path program 1 times [2022-07-13 22:42:51,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:42:51,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681480271] [2022-07-13 22:42:51,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:42:51,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:42:51,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:52,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:42:52,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:52,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:42:52,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:52,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 22:42:52,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:52,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 22:42:52,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:52,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:42:52,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:52,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 22:42:52,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:52,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 22:42:52,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:52,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-13 22:42:52,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:52,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:42:52,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:52,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-13 22:42:52,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:52,168 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-07-13 22:42:52,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:42:52,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681480271] [2022-07-13 22:42:52,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681480271] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:42:52,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:42:52,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 22:42:52,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105505593] [2022-07-13 22:42:52,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:42:52,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 22:42:52,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:42:52,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 22:42:52,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-13 22:42:52,171 INFO L87 Difference]: Start difference. First operand 227 states and 288 transitions. Second operand has 9 states, 8 states have (on average 5.125) internal successors, (41), 9 states have internal predecessors, (41), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-13 22:42:52,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:42:52,443 INFO L93 Difference]: Finished difference Result 279 states and 365 transitions. [2022-07-13 22:42:52,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 22:42:52,444 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 9 states have internal predecessors, (41), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 86 [2022-07-13 22:42:52,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:42:52,445 INFO L225 Difference]: With dead ends: 279 [2022-07-13 22:42:52,445 INFO L226 Difference]: Without dead ends: 253 [2022-07-13 22:42:52,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-07-13 22:42:52,446 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 61 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 22:42:52,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 596 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 22:42:52,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-07-13 22:42:52,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 236. [2022-07-13 22:42:52,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 159 states have (on average 1.1572327044025157) internal successors, (184), 168 states have internal predecessors, (184), 55 states have call successors, (55), 21 states have call predecessors, (55), 21 states have return successors, (66), 46 states have call predecessors, (66), 52 states have call successors, (66) [2022-07-13 22:42:52,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 305 transitions. [2022-07-13 22:42:52,481 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 305 transitions. Word has length 86 [2022-07-13 22:42:52,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:42:52,482 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 305 transitions. [2022-07-13 22:42:52,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 9 states have internal predecessors, (41), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-13 22:42:52,482 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 305 transitions. [2022-07-13 22:42:52,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-13 22:42:52,483 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:42:52,483 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 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] [2022-07-13 22:42:52,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-13 22:42:52,484 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:42:52,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:42:52,484 INFO L85 PathProgramCache]: Analyzing trace with hash 755723522, now seen corresponding path program 1 times [2022-07-13 22:42:52,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:42:52,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147356577] [2022-07-13 22:42:52,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:42:52,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:42:52,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:52,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:42:52,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:52,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:42:52,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:52,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 22:42:52,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:52,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 22:42:52,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:52,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:42:52,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:52,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 22:42:52,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:52,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 22:42:52,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:52,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-13 22:42:52,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:52,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:42:52,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:52,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-13 22:42:52,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:52,857 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 40 proven. 5 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-13 22:42:52,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:42:52,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147356577] [2022-07-13 22:42:52,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147356577] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:42:52,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513862496] [2022-07-13 22:42:52,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:42:52,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:42:52,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:42:52,859 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-13 22:42:52,889 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-13 22:42:57,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:42:57,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 2625 conjuncts, 62 conjunts are in the unsatisfiable core [2022-07-13 22:42:57,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:42:57,717 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-07-13 22:42:57,855 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-13 22:42:57,856 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2022-07-13 22:42:57,904 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-07-13 22:42:57,904 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-07-13 22:42:58,118 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-13 22:42:58,119 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-13 22:42:58,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 14 treesize of output 14 [2022-07-13 22:42:58,154 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 22:42:58,597 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 35 proven. 46 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 22:42:58,597 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:42:58,921 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 40 proven. 6 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-07-13 22:42:58,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [513862496] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:42:58,921 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:42:58,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 19, 11] total 31 [2022-07-13 22:42:58,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370904918] [2022-07-13 22:42:58,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:42:58,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-13 22:42:58,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:42:58,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-13 22:42:58,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=818, Unknown=0, NotChecked=0, Total=930 [2022-07-13 22:42:58,924 INFO L87 Difference]: Start difference. First operand 236 states and 305 transitions. Second operand has 31 states, 29 states have (on average 3.5172413793103448) internal successors, (102), 28 states have internal predecessors, (102), 10 states have call successors, (22), 5 states have call predecessors, (22), 7 states have return successors, (22), 8 states have call predecessors, (22), 9 states have call successors, (22) [2022-07-13 22:42:59,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:42:59,880 INFO L93 Difference]: Finished difference Result 334 states and 435 transitions. [2022-07-13 22:42:59,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-13 22:42:59,881 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 3.5172413793103448) internal successors, (102), 28 states have internal predecessors, (102), 10 states have call successors, (22), 5 states have call predecessors, (22), 7 states have return successors, (22), 8 states have call predecessors, (22), 9 states have call successors, (22) Word has length 86 [2022-07-13 22:42:59,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:42:59,883 INFO L225 Difference]: With dead ends: 334 [2022-07-13 22:42:59,883 INFO L226 Difference]: Without dead ends: 300 [2022-07-13 22:42:59,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 163 SyntacticMatches, 16 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=216, Invalid=1506, Unknown=0, NotChecked=0, Total=1722 [2022-07-13 22:42:59,884 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 89 mSDsluCounter, 1608 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 1736 SdHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 258 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 22:42:59,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 1736 Invalid, 962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 683 Invalid, 0 Unknown, 258 Unchecked, 0.6s Time] [2022-07-13 22:42:59,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2022-07-13 22:42:59,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 262. [2022-07-13 22:42:59,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 178 states have (on average 1.151685393258427) internal successors, (205), 188 states have internal predecessors, (205), 58 states have call successors, (58), 25 states have call predecessors, (58), 25 states have return successors, (67), 48 states have call predecessors, (67), 55 states have call successors, (67) [2022-07-13 22:42:59,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 330 transitions. [2022-07-13 22:42:59,930 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 330 transitions. Word has length 86 [2022-07-13 22:42:59,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:42:59,930 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 330 transitions. [2022-07-13 22:42:59,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 3.5172413793103448) internal successors, (102), 28 states have internal predecessors, (102), 10 states have call successors, (22), 5 states have call predecessors, (22), 7 states have return successors, (22), 8 states have call predecessors, (22), 9 states have call successors, (22) [2022-07-13 22:42:59,931 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 330 transitions. [2022-07-13 22:42:59,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-07-13 22:42:59,932 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:42:59,932 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-13 22:42:59,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-07-13 22:43:00,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:43:00,141 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:43:00,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:43:00,141 INFO L85 PathProgramCache]: Analyzing trace with hash -98466641, now seen corresponding path program 1 times [2022-07-13 22:43:00,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:43:00,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742321736] [2022-07-13 22:43:00,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:00,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:43:00,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:00,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:43:00,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:00,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:43:00,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:00,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:43:00,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:00,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 22:43:00,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:00,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 22:43:00,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:00,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 22:43:00,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:00,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 22:43:00,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:00,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-13 22:43:00,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:00,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-13 22:43:00,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:00,378 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-07-13 22:43:00,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:43:00,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742321736] [2022-07-13 22:43:00,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742321736] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:43:00,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749372753] [2022-07-13 22:43:00,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:00,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:43:00,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:43:00,384 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-13 22:43:00,412 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-13 22:43:00,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:00,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 2633 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-13 22:43:00,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:43:00,908 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-13 22:43:00,908 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:43:00,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749372753] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:43:00,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:43:00,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 11 [2022-07-13 22:43:00,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459440015] [2022-07-13 22:43:00,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:43:00,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 22:43:00,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:43:00,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 22:43:00,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-13 22:43:00,910 INFO L87 Difference]: Start difference. First operand 262 states and 330 transitions. Second operand has 9 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-13 22:43:01,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:43:01,034 INFO L93 Difference]: Finished difference Result 409 states and 527 transitions. [2022-07-13 22:43:01,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 22:43:01,035 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 85 [2022-07-13 22:43:01,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:43:01,037 INFO L225 Difference]: With dead ends: 409 [2022-07-13 22:43:01,037 INFO L226 Difference]: Without dead ends: 262 [2022-07-13 22:43:01,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-07-13 22:43:01,039 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 11 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:43:01,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 774 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 22:43:01,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-07-13 22:43:01,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2022-07-13 22:43:01,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 178 states have (on average 1.146067415730337) internal successors, (204), 188 states have internal predecessors, (204), 58 states have call successors, (58), 25 states have call predecessors, (58), 25 states have return successors, (66), 48 states have call predecessors, (66), 55 states have call successors, (66) [2022-07-13 22:43:01,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 328 transitions. [2022-07-13 22:43:01,100 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 328 transitions. Word has length 85 [2022-07-13 22:43:01,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:43:01,100 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 328 transitions. [2022-07-13 22:43:01,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-13 22:43:01,100 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 328 transitions. [2022-07-13 22:43:01,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-07-13 22:43:01,102 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:43:01,102 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-13 22:43:01,132 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-13 22:43:01,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:43:01,318 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:43:01,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:43:01,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1314150920, now seen corresponding path program 2 times [2022-07-13 22:43:01,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:43:01,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254368867] [2022-07-13 22:43:01,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:01,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:43:01,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:02,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:43:02,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:02,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:43:02,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:02,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:43:02,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:02,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 22:43:02,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:02,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-13 22:43:02,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:02,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:43:02,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:02,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 22:43:02,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:02,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:43:02,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:02,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 22:43:02,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:02,371 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-13 22:43:02,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:43:02,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254368867] [2022-07-13 22:43:02,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254368867] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:43:02,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:43:02,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-07-13 22:43:02,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422612992] [2022-07-13 22:43:02,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:43:02,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-13 22:43:02,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:43:02,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-13 22:43:02,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2022-07-13 22:43:02,373 INFO L87 Difference]: Start difference. First operand 262 states and 328 transitions. Second operand has 21 states, 20 states have (on average 2.35) internal successors, (47), 19 states have internal predecessors, (47), 7 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) [2022-07-13 22:43:04,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:43:04,661 INFO L93 Difference]: Finished difference Result 417 states and 551 transitions. [2022-07-13 22:43:04,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-13 22:43:04,662 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.35) internal successors, (47), 19 states have internal predecessors, (47), 7 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) Word has length 87 [2022-07-13 22:43:04,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:43:04,664 INFO L225 Difference]: With dead ends: 417 [2022-07-13 22:43:04,664 INFO L226 Difference]: Without dead ends: 346 [2022-07-13 22:43:04,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=195, Invalid=1137, Unknown=0, NotChecked=0, Total=1332 [2022-07-13 22:43:04,665 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 135 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 2585 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 2692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 2585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-13 22:43:04,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 753 Invalid, 2692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 2585 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-13 22:43:04,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2022-07-13 22:43:04,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 269. [2022-07-13 22:43:04,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 184 states have (on average 1.1467391304347827) internal successors, (211), 195 states have internal predecessors, (211), 58 states have call successors, (58), 25 states have call predecessors, (58), 26 states have return successors, (68), 48 states have call predecessors, (68), 55 states have call successors, (68) [2022-07-13 22:43:04,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 337 transitions. [2022-07-13 22:43:04,703 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 337 transitions. Word has length 87 [2022-07-13 22:43:04,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:43:04,703 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 337 transitions. [2022-07-13 22:43:04,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.35) internal successors, (47), 19 states have internal predecessors, (47), 7 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) [2022-07-13 22:43:04,704 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 337 transitions. [2022-07-13 22:43:04,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-07-13 22:43:04,706 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:43:04,706 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-13 22:43:04,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-13 22:43:04,706 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:43:04,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:43:04,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1572316358, now seen corresponding path program 1 times [2022-07-13 22:43:04,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:43:04,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971889680] [2022-07-13 22:43:04,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:04,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:43:04,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:04,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:43:04,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:04,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:43:04,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:04,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:43:04,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:04,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 22:43:04,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:04,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-13 22:43:04,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:04,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:43:04,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:04,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 22:43:04,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:05,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:43:05,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:05,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 22:43:05,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:05,147 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 28 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-13 22:43:05,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:43:05,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971889680] [2022-07-13 22:43:05,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971889680] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:43:05,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775483452] [2022-07-13 22:43:05,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:05,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:43:05,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:43:05,150 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-13 22:43:05,182 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-13 22:43:05,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:05,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 2638 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 22:43:05,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:43:05,711 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-07-13 22:43:05,711 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:43:05,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775483452] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:43:05,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:43:05,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [18] total 20 [2022-07-13 22:43:05,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624525932] [2022-07-13 22:43:05,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:43:05,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 22:43:05,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:43:05,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 22:43:05,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2022-07-13 22:43:05,712 INFO L87 Difference]: Start difference. First operand 269 states and 337 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2022-07-13 22:43:05,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:43:05,835 INFO L93 Difference]: Finished difference Result 424 states and 549 transitions. [2022-07-13 22:43:05,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 22:43:05,836 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) Word has length 87 [2022-07-13 22:43:05,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:43:05,838 INFO L225 Difference]: With dead ends: 424 [2022-07-13 22:43:05,838 INFO L226 Difference]: Without dead ends: 262 [2022-07-13 22:43:05,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2022-07-13 22:43:05,840 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 3 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:43:05,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 246 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 26 Unchecked, 0.1s Time] [2022-07-13 22:43:05,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-07-13 22:43:05,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2022-07-13 22:43:05,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 178 states have (on average 1.1348314606741574) internal successors, (202), 188 states have internal predecessors, (202), 58 states have call successors, (58), 25 states have call predecessors, (58), 25 states have return successors, (64), 48 states have call predecessors, (64), 55 states have call successors, (64) [2022-07-13 22:43:05,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 324 transitions. [2022-07-13 22:43:05,881 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 324 transitions. Word has length 87 [2022-07-13 22:43:05,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:43:05,882 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 324 transitions. [2022-07-13 22:43:05,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2022-07-13 22:43:05,882 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 324 transitions. [2022-07-13 22:43:05,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-13 22:43:05,884 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:43:05,884 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:43:05,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-07-13 22:43:06,115 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,SelfDestructingSolverStorable21 [2022-07-13 22:43:06,116 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:43:06,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:43:06,116 INFO L85 PathProgramCache]: Analyzing trace with hash -375331136, now seen corresponding path program 1 times [2022-07-13 22:43:06,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:43:06,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180071565] [2022-07-13 22:43:06,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:06,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:43:06,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:06,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:43:06,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:06,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:43:06,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:06,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:43:06,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:06,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 22:43:06,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:06,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-13 22:43:06,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:06,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:43:06,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:06,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-13 22:43:06,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:06,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-13 22:43:06,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:06,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-13 22:43:06,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:06,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-13 22:43:06,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:06,717 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 31 proven. 10 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-13 22:43:06,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:43:06,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180071565] [2022-07-13 22:43:06,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180071565] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:43:06,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223765867] [2022-07-13 22:43:06,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:06,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:43:06,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:43:06,719 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-13 22:43:06,720 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-13 22:43:07,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:07,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 2638 conjuncts, 50 conjunts are in the unsatisfiable core [2022-07-13 22:43:07,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:43:07,277 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 22:43:07,720 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-13 22:43:07,722 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 16 treesize of output 8 [2022-07-13 22:43:07,750 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-13 22:43:07,750 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:43:07,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223765867] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:43:07,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:43:07,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [20] total 33 [2022-07-13 22:43:07,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793845230] [2022-07-13 22:43:07,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:43:07,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-13 22:43:07,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:43:07,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-13 22:43:07,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=946, Unknown=0, NotChecked=0, Total=1056 [2022-07-13 22:43:07,752 INFO L87 Difference]: Start difference. First operand 262 states and 324 transitions. Second operand has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 11 states have internal predecessors, (55), 5 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-13 22:43:08,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:43:08,050 INFO L93 Difference]: Finished difference Result 395 states and 489 transitions. [2022-07-13 22:43:08,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-13 22:43:08,050 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 11 states have internal predecessors, (55), 5 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 88 [2022-07-13 22:43:08,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:43:08,054 INFO L225 Difference]: With dead ends: 395 [2022-07-13 22:43:08,054 INFO L226 Difference]: Without dead ends: 293 [2022-07-13 22:43:08,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=143, Invalid=1189, Unknown=0, NotChecked=0, Total=1332 [2022-07-13 22:43:08,060 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 52 mSDsluCounter, 1250 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 1407 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 284 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 22:43:08,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 1407 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 163 Invalid, 0 Unknown, 284 Unchecked, 0.2s Time] [2022-07-13 22:43:08,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2022-07-13 22:43:08,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 264. [2022-07-13 22:43:08,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 180 states have (on average 1.1222222222222222) internal successors, (202), 189 states have internal predecessors, (202), 56 states have call successors, (56), 26 states have call predecessors, (56), 27 states have return successors, (62), 48 states have call predecessors, (62), 53 states have call successors, (62) [2022-07-13 22:43:08,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 320 transitions. [2022-07-13 22:43:08,102 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 320 transitions. Word has length 88 [2022-07-13 22:43:08,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:43:08,102 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 320 transitions. [2022-07-13 22:43:08,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 11 states have internal predecessors, (55), 5 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-13 22:43:08,103 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 320 transitions. [2022-07-13 22:43:08,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-07-13 22:43:08,104 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:43:08,105 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 3, 3, 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] [2022-07-13 22:43:08,135 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-13 22:43:08,324 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,SelfDestructingSolverStorable22 [2022-07-13 22:43:08,325 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:43:08,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:43:08,325 INFO L85 PathProgramCache]: Analyzing trace with hash -253022058, now seen corresponding path program 1 times [2022-07-13 22:43:08,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:43:08,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698617690] [2022-07-13 22:43:08,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:08,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:43:08,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:08,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:43:08,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:08,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:43:08,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:08,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 22:43:08,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:08,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 22:43:08,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:08,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:43:08,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:08,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 22:43:08,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:08,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 22:43:08,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:08,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-13 22:43:08,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:08,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:43:08,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:08,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-13 22:43:08,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:08,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-13 22:43:08,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:08,473 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-07-13 22:43:08,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:43:08,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698617690] [2022-07-13 22:43:08,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698617690] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:43:08,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:43:08,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 22:43:08,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247711408] [2022-07-13 22:43:08,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:43:08,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 22:43:08,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:43:08,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 22:43:08,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 22:43:08,476 INFO L87 Difference]: Start difference. First operand 264 states and 320 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2022-07-13 22:43:08,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:43:08,515 INFO L93 Difference]: Finished difference Result 278 states and 337 transitions. [2022-07-13 22:43:08,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 22:43:08,516 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 90 [2022-07-13 22:43:08,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:43:08,517 INFO L225 Difference]: With dead ends: 278 [2022-07-13 22:43:08,517 INFO L226 Difference]: Without dead ends: 265 [2022-07-13 22:43:08,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 22:43:08,520 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 0 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:43:08,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 197 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 22:43:08,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2022-07-13 22:43:08,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2022-07-13 22:43:08,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 181 states have (on average 1.1215469613259668) internal successors, (203), 190 states have internal predecessors, (203), 56 states have call successors, (56), 26 states have call predecessors, (56), 27 states have return successors, (62), 48 states have call predecessors, (62), 53 states have call successors, (62) [2022-07-13 22:43:08,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 321 transitions. [2022-07-13 22:43:08,568 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 321 transitions. Word has length 90 [2022-07-13 22:43:08,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:43:08,568 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 321 transitions. [2022-07-13 22:43:08,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2022-07-13 22:43:08,569 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 321 transitions. [2022-07-13 22:43:08,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-07-13 22:43:08,570 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:43:08,570 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 3, 3, 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] [2022-07-13 22:43:08,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-13 22:43:08,570 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:43:08,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:43:08,571 INFO L85 PathProgramCache]: Analyzing trace with hash -266130098, now seen corresponding path program 1 times [2022-07-13 22:43:08,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:43:08,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766073473] [2022-07-13 22:43:08,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:08,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:43:08,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:08,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:43:08,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:08,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:43:08,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:08,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 22:43:08,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:08,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 22:43:08,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:08,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:43:08,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:08,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 22:43:08,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:08,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 22:43:08,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:08,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-13 22:43:08,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:08,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:43:08,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:08,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-13 22:43:08,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:08,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-13 22:43:08,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:08,786 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-07-13 22:43:08,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:43:08,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766073473] [2022-07-13 22:43:08,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766073473] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:43:08,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:43:08,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 22:43:08,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638765629] [2022-07-13 22:43:08,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:43:08,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 22:43:08,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:43:08,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 22:43:08,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 22:43:08,789 INFO L87 Difference]: Start difference. First operand 265 states and 321 transitions. Second operand has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-13 22:43:09,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:43:09,064 INFO L93 Difference]: Finished difference Result 306 states and 381 transitions. [2022-07-13 22:43:09,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 22:43:09,064 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 90 [2022-07-13 22:43:09,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:43:09,066 INFO L225 Difference]: With dead ends: 306 [2022-07-13 22:43:09,066 INFO L226 Difference]: Without dead ends: 304 [2022-07-13 22:43:09,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-07-13 22:43:09,067 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 24 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 22:43:09,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 772 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 22:43:09,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-07-13 22:43:09,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 292. [2022-07-13 22:43:09,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 194 states have (on average 1.1237113402061856) internal successors, (218), 205 states have internal predecessors, (218), 69 states have call successors, (69), 27 states have call predecessors, (69), 28 states have return successors, (76), 59 states have call predecessors, (76), 66 states have call successors, (76) [2022-07-13 22:43:09,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 363 transitions. [2022-07-13 22:43:09,142 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 363 transitions. Word has length 90 [2022-07-13 22:43:09,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:43:09,142 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 363 transitions. [2022-07-13 22:43:09,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-13 22:43:09,142 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 363 transitions. [2022-07-13 22:43:09,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-07-13 22:43:09,144 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:43:09,144 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 3, 3, 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] [2022-07-13 22:43:09,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-13 22:43:09,144 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:43:09,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:43:09,144 INFO L85 PathProgramCache]: Analyzing trace with hash -195763756, now seen corresponding path program 1 times [2022-07-13 22:43:09,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:43:09,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657023207] [2022-07-13 22:43:09,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:09,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:43:09,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:09,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:43:09,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:09,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:43:09,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:09,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 22:43:09,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:09,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 22:43:09,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:09,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:43:09,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:09,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 22:43:09,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:09,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 22:43:09,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:09,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-13 22:43:09,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:09,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:43:09,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:09,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-13 22:43:09,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:09,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-13 22:43:09,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:09,559 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-07-13 22:43:09,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:43:09,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657023207] [2022-07-13 22:43:09,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657023207] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:43:09,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:43:09,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-13 22:43:09,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972121771] [2022-07-13 22:43:09,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:43:09,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-13 22:43:09,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:43:09,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-13 22:43:09,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-07-13 22:43:09,563 INFO L87 Difference]: Start difference. First operand 292 states and 363 transitions. Second operand has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 6 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-07-13 22:43:10,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:43:10,371 INFO L93 Difference]: Finished difference Result 316 states and 394 transitions. [2022-07-13 22:43:10,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 22:43:10,372 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 6 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 90 [2022-07-13 22:43:10,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:43:10,374 INFO L225 Difference]: With dead ends: 316 [2022-07-13 22:43:10,374 INFO L226 Difference]: Without dead ends: 314 [2022-07-13 22:43:10,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2022-07-13 22:43:10,375 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 63 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 22:43:10,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 951 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 22:43:10,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2022-07-13 22:43:10,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 301. [2022-07-13 22:43:10,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 200 states have (on average 1.13) internal successors, (226), 211 states have internal predecessors, (226), 71 states have call successors, (71), 28 states have call predecessors, (71), 29 states have return successors, (78), 61 states have call predecessors, (78), 68 states have call successors, (78) [2022-07-13 22:43:10,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 375 transitions. [2022-07-13 22:43:10,427 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 375 transitions. Word has length 90 [2022-07-13 22:43:10,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:43:10,427 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 375 transitions. [2022-07-13 22:43:10,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 6 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-07-13 22:43:10,428 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 375 transitions. [2022-07-13 22:43:10,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-07-13 22:43:10,429 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:43:10,429 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 3, 3, 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] [2022-07-13 22:43:10,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-13 22:43:10,430 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:43:10,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:43:10,430 INFO L85 PathProgramCache]: Analyzing trace with hash -747210356, now seen corresponding path program 1 times [2022-07-13 22:43:10,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:43:10,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800542620] [2022-07-13 22:43:10,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:10,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:43:10,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:10,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:43:10,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:10,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:43:10,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:10,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 22:43:10,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:10,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 22:43:10,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:10,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:43:10,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:10,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 22:43:10,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:10,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 22:43:10,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:10,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-13 22:43:10,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:10,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:43:10,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:10,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-13 22:43:10,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:10,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-13 22:43:10,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:10,940 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-07-13 22:43:10,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:43:10,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800542620] [2022-07-13 22:43:10,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800542620] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:43:10,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:43:10,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-13 22:43:10,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684546634] [2022-07-13 22:43:10,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:43:10,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 22:43:10,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:43:10,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 22:43:10,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-13 22:43:10,943 INFO L87 Difference]: Start difference. First operand 301 states and 375 transitions. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-13 22:43:11,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:43:11,543 INFO L93 Difference]: Finished difference Result 359 states and 455 transitions. [2022-07-13 22:43:11,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 22:43:11,544 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 90 [2022-07-13 22:43:11,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:43:11,548 INFO L225 Difference]: With dead ends: 359 [2022-07-13 22:43:11,548 INFO L226 Difference]: Without dead ends: 337 [2022-07-13 22:43:11,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2022-07-13 22:43:11,549 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 23 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 22:43:11,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 519 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 22:43:11,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-07-13 22:43:11,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 320. [2022-07-13 22:43:11,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 210 states have (on average 1.1285714285714286) internal successors, (237), 220 states have internal predecessors, (237), 80 states have call successors, (80), 28 states have call predecessors, (80), 29 states have return successors, (87), 71 states have call predecessors, (87), 77 states have call successors, (87) [2022-07-13 22:43:11,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 404 transitions. [2022-07-13 22:43:11,617 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 404 transitions. Word has length 90 [2022-07-13 22:43:11,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:43:11,618 INFO L495 AbstractCegarLoop]: Abstraction has 320 states and 404 transitions. [2022-07-13 22:43:11,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-13 22:43:11,618 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 404 transitions. [2022-07-13 22:43:11,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-07-13 22:43:11,620 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:43:11,620 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 3, 3, 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] [2022-07-13 22:43:11,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-13 22:43:11,620 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:43:11,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:43:11,621 INFO L85 PathProgramCache]: Analyzing trace with hash -676844014, now seen corresponding path program 1 times [2022-07-13 22:43:11,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:43:11,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866248773] [2022-07-13 22:43:11,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:11,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:43:11,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:12,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:43:12,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:12,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:43:12,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:12,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 22:43:12,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:12,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 22:43:12,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:12,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:43:12,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:12,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 22:43:12,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:12,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 22:43:12,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:12,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-13 22:43:12,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:12,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:43:12,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:12,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-13 22:43:12,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:12,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-13 22:43:12,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:12,293 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-07-13 22:43:12,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:43:12,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866248773] [2022-07-13 22:43:12,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866248773] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:43:12,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:43:12,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-13 22:43:12,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548484140] [2022-07-13 22:43:12,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:43:12,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-13 22:43:12,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:43:12,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-13 22:43:12,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-07-13 22:43:12,296 INFO L87 Difference]: Start difference. First operand 320 states and 404 transitions. Second operand has 13 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 6 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2022-07-13 22:43:12,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:43:12,871 INFO L93 Difference]: Finished difference Result 343 states and 433 transitions. [2022-07-13 22:43:12,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 22:43:12,872 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 6 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) Word has length 90 [2022-07-13 22:43:12,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:43:12,873 INFO L225 Difference]: With dead ends: 343 [2022-07-13 22:43:12,873 INFO L226 Difference]: Without dead ends: 341 [2022-07-13 22:43:12,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2022-07-13 22:43:12,874 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 33 mSDsluCounter, 779 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 22:43:12,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 886 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 22:43:12,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2022-07-13 22:43:12,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 324. [2022-07-13 22:43:12,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 213 states have (on average 1.1314553990610328) internal successors, (241), 222 states have internal predecessors, (241), 81 states have call successors, (81), 28 states have call predecessors, (81), 29 states have return successors, (88), 73 states have call predecessors, (88), 78 states have call successors, (88) [2022-07-13 22:43:12,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 410 transitions. [2022-07-13 22:43:12,940 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 410 transitions. Word has length 90 [2022-07-13 22:43:12,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:43:12,940 INFO L495 AbstractCegarLoop]: Abstraction has 324 states and 410 transitions. [2022-07-13 22:43:12,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 6 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2022-07-13 22:43:12,940 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 410 transitions. [2022-07-13 22:43:12,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-07-13 22:43:12,942 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:43:12,942 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 3, 3, 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] [2022-07-13 22:43:12,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-13 22:43:12,943 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:43:12,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:43:12,943 INFO L85 PathProgramCache]: Analyzing trace with hash -689952054, now seen corresponding path program 1 times [2022-07-13 22:43:12,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:43:12,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094885442] [2022-07-13 22:43:12,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:12,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:43:13,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:13,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:43:13,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:13,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:43:13,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:13,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 22:43:13,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:13,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 22:43:13,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:13,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:43:13,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:13,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 22:43:13,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:13,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 22:43:13,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:13,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-13 22:43:13,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:13,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:43:13,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:13,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-13 22:43:13,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:13,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-13 22:43:13,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:13,373 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-07-13 22:43:13,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:43:13,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094885442] [2022-07-13 22:43:13,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094885442] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:43:13,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372094509] [2022-07-13 22:43:13,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:13,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:43:13,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:43:13,375 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-13 22:43:13,377 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-13 22:43:13,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:13,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 2634 conjuncts, 44 conjunts are in the unsatisfiable core [2022-07-13 22:43:13,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:43:14,081 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 49 treesize of output 33 [2022-07-13 22:43:14,174 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 7 proven. 45 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-07-13 22:43:14,174 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:43:14,368 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 24 treesize of output 16 [2022-07-13 22:43:14,408 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-13 22:43:14,408 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-13 22:43:14,416 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-07-13 22:43:14,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1372094509] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:43:14,416 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:43:14,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 10] total 22 [2022-07-13 22:43:14,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101755909] [2022-07-13 22:43:14,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:43:14,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-13 22:43:14,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:43:14,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-13 22:43:14,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2022-07-13 22:43:14,418 INFO L87 Difference]: Start difference. First operand 324 states and 410 transitions. Second operand has 22 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 21 states have internal predecessors, (69), 10 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 8 states have call predecessors, (20), 9 states have call successors, (20) [2022-07-13 22:43:16,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:43:16,436 INFO L93 Difference]: Finished difference Result 509 states and 694 transitions. [2022-07-13 22:43:16,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-07-13 22:43:16,437 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 21 states have internal predecessors, (69), 10 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 8 states have call predecessors, (20), 9 states have call successors, (20) Word has length 90 [2022-07-13 22:43:16,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:43:16,439 INFO L225 Difference]: With dead ends: 509 [2022-07-13 22:43:16,440 INFO L226 Difference]: Without dead ends: 494 [2022-07-13 22:43:16,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 187 SyntacticMatches, 10 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 725 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=346, Invalid=2306, Unknown=0, NotChecked=0, Total=2652 [2022-07-13 22:43:16,442 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 164 mSDsluCounter, 1483 mSDsCounter, 0 mSdLazyCounter, 1274 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 1647 SdHoareTripleChecker+Invalid, 1684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 1274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 217 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:43:16,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 1647 Invalid, 1684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 1274 Invalid, 0 Unknown, 217 Unchecked, 1.0s Time] [2022-07-13 22:43:16,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2022-07-13 22:43:16,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 340. [2022-07-13 22:43:16,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 221 states have (on average 1.1266968325791855) internal successors, (249), 229 states have internal predecessors, (249), 89 states have call successors, (89), 28 states have call predecessors, (89), 29 states have return successors, (100), 82 states have call predecessors, (100), 86 states have call successors, (100) [2022-07-13 22:43:16,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 438 transitions. [2022-07-13 22:43:16,517 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 438 transitions. Word has length 90 [2022-07-13 22:43:16,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:43:16,518 INFO L495 AbstractCegarLoop]: Abstraction has 340 states and 438 transitions. [2022-07-13 22:43:16,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 21 states have internal predecessors, (69), 10 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 8 states have call predecessors, (20), 9 states have call successors, (20) [2022-07-13 22:43:16,518 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 438 transitions. [2022-07-13 22:43:16,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-13 22:43:16,520 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:43:16,520 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:43:16,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-07-13 22:43:16,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:43:16,747 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:43:16,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:43:16,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1680266801, now seen corresponding path program 1 times [2022-07-13 22:43:16,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:43:16,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439174211] [2022-07-13 22:43:16,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:16,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:43:16,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:16,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:43:16,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:16,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:43:16,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:16,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:43:16,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:16,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 22:43:16,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:16,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-13 22:43:16,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:16,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:43:16,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:16,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 22:43:16,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:16,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:43:16,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:16,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 22:43:16,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:17,021 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-07-13 22:43:17,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:43:17,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439174211] [2022-07-13 22:43:17,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439174211] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:43:17,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:43:17,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-13 22:43:17,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042721053] [2022-07-13 22:43:17,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:43:17,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 22:43:17,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:43:17,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 22:43:17,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-07-13 22:43:17,023 INFO L87 Difference]: Start difference. First operand 340 states and 438 transitions. Second operand has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 11 states have internal predecessors, (46), 2 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2022-07-13 22:43:17,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:43:17,545 INFO L93 Difference]: Finished difference Result 346 states and 443 transitions. [2022-07-13 22:43:17,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-13 22:43:17,545 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 11 states have internal predecessors, (46), 2 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) Word has length 89 [2022-07-13 22:43:17,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:43:17,547 INFO L225 Difference]: With dead ends: 346 [2022-07-13 22:43:17,547 INFO L226 Difference]: Without dead ends: 344 [2022-07-13 22:43:17,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=527, Unknown=0, NotChecked=0, Total=650 [2022-07-13 22:43:17,548 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 60 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 612 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 22:43:17,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 637 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 612 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 22:43:17,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2022-07-13 22:43:17,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2022-07-13 22:43:17,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 224 states have (on average 1.125) internal successors, (252), 232 states have internal predecessors, (252), 89 states have call successors, (89), 29 states have call predecessors, (89), 30 states have return successors, (100), 82 states have call predecessors, (100), 86 states have call successors, (100) [2022-07-13 22:43:17,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 441 transitions. [2022-07-13 22:43:17,615 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 441 transitions. Word has length 89 [2022-07-13 22:43:17,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:43:17,615 INFO L495 AbstractCegarLoop]: Abstraction has 344 states and 441 transitions. [2022-07-13 22:43:17,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 11 states have internal predecessors, (46), 2 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2022-07-13 22:43:17,616 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 441 transitions. [2022-07-13 22:43:17,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-07-13 22:43:17,617 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:43:17,617 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2022-07-13 22:43:17,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-13 22:43:17,618 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:43:17,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:43:17,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1792661847, now seen corresponding path program 1 times [2022-07-13 22:43:17,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:43:17,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004916197] [2022-07-13 22:43:17,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:17,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:43:17,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:17,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:43:17,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:17,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:43:17,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:17,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 22:43:17,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:17,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 22:43:17,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:17,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:43:17,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:17,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 22:43:17,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:18,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 22:43:18,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:18,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-13 22:43:18,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:18,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:43:18,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:18,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-13 22:43:18,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:18,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-13 22:43:18,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:18,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-13 22:43:18,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:18,043 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2022-07-13 22:43:18,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:43:18,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004916197] [2022-07-13 22:43:18,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004916197] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:43:18,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:43:18,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-13 22:43:18,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588026133] [2022-07-13 22:43:18,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:43:18,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 22:43:18,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:43:18,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 22:43:18,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-13 22:43:18,045 INFO L87 Difference]: Start difference. First operand 344 states and 441 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-07-13 22:43:18,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:43:18,701 INFO L93 Difference]: Finished difference Result 382 states and 492 transitions. [2022-07-13 22:43:18,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 22:43:18,701 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 96 [2022-07-13 22:43:18,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:43:18,704 INFO L225 Difference]: With dead ends: 382 [2022-07-13 22:43:18,704 INFO L226 Difference]: Without dead ends: 364 [2022-07-13 22:43:18,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-07-13 22:43:18,705 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 16 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 22:43:18,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 604 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 22:43:18,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2022-07-13 22:43:18,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 355. [2022-07-13 22:43:18,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 229 states have (on average 1.1266375545851528) internal successors, (258), 237 states have internal predecessors, (258), 95 states have call successors, (95), 29 states have call predecessors, (95), 30 states have return successors, (106), 88 states have call predecessors, (106), 92 states have call successors, (106) [2022-07-13 22:43:18,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 459 transitions. [2022-07-13 22:43:18,799 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 459 transitions. Word has length 96 [2022-07-13 22:43:18,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:43:18,800 INFO L495 AbstractCegarLoop]: Abstraction has 355 states and 459 transitions. [2022-07-13 22:43:18,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2022-07-13 22:43:18,800 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 459 transitions. [2022-07-13 22:43:18,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-07-13 22:43:18,802 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:43:18,802 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2022-07-13 22:43:18,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-13 22:43:18,802 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:43:18,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:43:18,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1410948513, now seen corresponding path program 1 times [2022-07-13 22:43:18,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:43:18,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206193648] [2022-07-13 22:43:18,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:18,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:43:18,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:18,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:43:18,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:18,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:43:18,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:18,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 22:43:18,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:18,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 22:43:18,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:18,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:43:18,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:18,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 22:43:18,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:18,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 22:43:18,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:18,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-13 22:43:18,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:18,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:43:18,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:18,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-13 22:43:18,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:18,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-13 22:43:18,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:19,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-13 22:43:19,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:19,009 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2022-07-13 22:43:19,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:43:19,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206193648] [2022-07-13 22:43:19,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206193648] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:43:19,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:43:19,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 22:43:19,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578787316] [2022-07-13 22:43:19,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:43:19,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 22:43:19,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:43:19,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 22:43:19,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 22:43:19,013 INFO L87 Difference]: Start difference. First operand 355 states and 459 transitions. Second operand has 8 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-13 22:43:19,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:43:19,326 INFO L93 Difference]: Finished difference Result 374 states and 482 transitions. [2022-07-13 22:43:19,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 22:43:19,326 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 96 [2022-07-13 22:43:19,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:43:19,330 INFO L225 Difference]: With dead ends: 374 [2022-07-13 22:43:19,330 INFO L226 Difference]: Without dead ends: 372 [2022-07-13 22:43:19,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-07-13 22:43:19,332 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 23 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 22:43:19,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 693 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 22:43:19,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2022-07-13 22:43:19,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 361. [2022-07-13 22:43:19,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 233 states have (on average 1.1244635193133048) internal successors, (262), 241 states have internal predecessors, (262), 96 states have call successors, (96), 30 states have call predecessors, (96), 31 states have return successors, (107), 89 states have call predecessors, (107), 93 states have call successors, (107) [2022-07-13 22:43:19,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 465 transitions. [2022-07-13 22:43:19,436 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 465 transitions. Word has length 96 [2022-07-13 22:43:19,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:43:19,436 INFO L495 AbstractCegarLoop]: Abstraction has 361 states and 465 transitions. [2022-07-13 22:43:19,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-13 22:43:19,437 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 465 transitions. [2022-07-13 22:43:19,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-07-13 22:43:19,438 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:43:19,439 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2022-07-13 22:43:19,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-13 22:43:19,439 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:43:19,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:43:19,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1751987097, now seen corresponding path program 1 times [2022-07-13 22:43:19,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:43:19,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116736203] [2022-07-13 22:43:19,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:19,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:43:19,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:19,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:43:19,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:19,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:43:19,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:19,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 22:43:19,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:19,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 22:43:19,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:19,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:43:19,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:19,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 22:43:19,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:19,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 22:43:19,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:19,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-13 22:43:19,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:19,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:43:19,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:19,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-13 22:43:19,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:19,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-13 22:43:19,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:19,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-13 22:43:19,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:19,953 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2022-07-13 22:43:19,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:43:19,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116736203] [2022-07-13 22:43:19,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116736203] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:43:19,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:43:19,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-13 22:43:19,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52146763] [2022-07-13 22:43:19,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:43:19,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-13 22:43:19,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:43:19,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-13 22:43:19,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-07-13 22:43:19,955 INFO L87 Difference]: Start difference. First operand 361 states and 465 transitions. Second operand has 15 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 14 states have internal predecessors, (35), 6 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2022-07-13 22:43:20,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:43:20,557 INFO L93 Difference]: Finished difference Result 381 states and 489 transitions. [2022-07-13 22:43:20,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 22:43:20,557 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 14 states have internal predecessors, (35), 6 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) Word has length 96 [2022-07-13 22:43:20,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:43:20,559 INFO L225 Difference]: With dead ends: 381 [2022-07-13 22:43:20,559 INFO L226 Difference]: Without dead ends: 379 [2022-07-13 22:43:20,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2022-07-13 22:43:20,560 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 54 mSDsluCounter, 839 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 960 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 22:43:20,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 960 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 22:43:20,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2022-07-13 22:43:20,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 368. [2022-07-13 22:43:20,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 237 states have (on average 1.1223628691983123) internal successors, (266), 246 states have internal predecessors, (266), 98 states have call successors, (98), 31 states have call predecessors, (98), 32 states have return successors, (109), 90 states have call predecessors, (109), 95 states have call successors, (109) [2022-07-13 22:43:20,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 473 transitions. [2022-07-13 22:43:20,651 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 473 transitions. Word has length 96 [2022-07-13 22:43:20,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:43:20,652 INFO L495 AbstractCegarLoop]: Abstraction has 368 states and 473 transitions. [2022-07-13 22:43:20,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 14 states have internal predecessors, (35), 6 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2022-07-13 22:43:20,652 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 473 transitions. [2022-07-13 22:43:20,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-07-13 22:43:20,654 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:43:20,654 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2022-07-13 22:43:20,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-07-13 22:43:20,654 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:43:20,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:43:20,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1241388199, now seen corresponding path program 1 times [2022-07-13 22:43:20,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:43:20,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370971963] [2022-07-13 22:43:20,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:20,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:43:20,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:20,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:43:20,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:20,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:43:20,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:20,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 22:43:20,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:20,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 22:43:20,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:20,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:43:20,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:20,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 22:43:20,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:20,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 22:43:20,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:20,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-13 22:43:20,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:20,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:43:20,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:20,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-13 22:43:20,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:20,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-13 22:43:20,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:20,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-13 22:43:20,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:20,955 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 14 proven. 18 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-07-13 22:43:20,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:43:20,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370971963] [2022-07-13 22:43:20,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370971963] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:43:20,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218691983] [2022-07-13 22:43:20,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:20,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:43:20,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:43:20,959 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:43:20,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-13 22:43:21,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:21,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 2616 conjuncts, 44 conjunts are in the unsatisfiable core [2022-07-13 22:43:21,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:43:21,629 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 53 treesize of output 37 [2022-07-13 22:43:21,701 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 19 proven. 45 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-07-13 22:43:21,701 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:43:21,919 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-13 22:43:21,919 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 20 treesize of output 19 [2022-07-13 22:43:21,926 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-07-13 22:43:21,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218691983] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:43:21,926 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:43:21,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 10] total 21 [2022-07-13 22:43:21,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356795688] [2022-07-13 22:43:21,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:43:21,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-13 22:43:21,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:43:21,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-13 22:43:21,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2022-07-13 22:43:21,928 INFO L87 Difference]: Start difference. First operand 368 states and 473 transitions. Second operand has 21 states, 20 states have (on average 3.6) internal successors, (72), 20 states have internal predecessors, (72), 10 states have call successors, (22), 3 states have call predecessors, (22), 5 states have return successors, (22), 9 states have call predecessors, (22), 10 states have call successors, (22) [2022-07-13 22:43:23,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:43:23,591 INFO L93 Difference]: Finished difference Result 602 states and 778 transitions. [2022-07-13 22:43:23,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-07-13 22:43:23,591 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.6) internal successors, (72), 20 states have internal predecessors, (72), 10 states have call successors, (22), 3 states have call predecessors, (22), 5 states have return successors, (22), 9 states have call predecessors, (22), 10 states have call successors, (22) Word has length 96 [2022-07-13 22:43:23,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:43:23,593 INFO L225 Difference]: With dead ends: 602 [2022-07-13 22:43:23,593 INFO L226 Difference]: Without dead ends: 492 [2022-07-13 22:43:23,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 201 SyntacticMatches, 8 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 566 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=342, Invalid=2010, Unknown=0, NotChecked=0, Total=2352 [2022-07-13 22:43:23,594 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 173 mSDsluCounter, 876 mSDsCounter, 0 mSdLazyCounter, 1363 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 1706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 1363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 174 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:43:23,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 1013 Invalid, 1706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 1363 Invalid, 0 Unknown, 174 Unchecked, 1.0s Time] [2022-07-13 22:43:23,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2022-07-13 22:43:23,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 371. [2022-07-13 22:43:23,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 238 states have (on average 1.1008403361344539) internal successors, (262), 245 states have internal predecessors, (262), 100 states have call successors, (100), 31 states have call predecessors, (100), 32 states have return successors, (111), 94 states have call predecessors, (111), 97 states have call successors, (111) [2022-07-13 22:43:23,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 473 transitions. [2022-07-13 22:43:23,692 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 473 transitions. Word has length 96 [2022-07-13 22:43:23,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:43:23,692 INFO L495 AbstractCegarLoop]: Abstraction has 371 states and 473 transitions. [2022-07-13 22:43:23,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.6) internal successors, (72), 20 states have internal predecessors, (72), 10 states have call successors, (22), 3 states have call predecessors, (22), 5 states have return successors, (22), 9 states have call predecessors, (22), 10 states have call successors, (22) [2022-07-13 22:43:23,692 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 473 transitions. [2022-07-13 22:43:23,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-13 22:43:23,694 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:43:23,694 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-07-13 22:43:23,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-13 22:43:23,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:43:23,914 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:43:23,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:43:23,914 INFO L85 PathProgramCache]: Analyzing trace with hash 263298865, now seen corresponding path program 1 times [2022-07-13 22:43:23,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:43:23,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650052010] [2022-07-13 22:43:23,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:23,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:43:24,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:24,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:43:24,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:24,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:43:24,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:24,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:43:24,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:24,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 22:43:24,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:24,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-13 22:43:24,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:24,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:43:24,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:24,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 22:43:24,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:24,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-13 22:43:24,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:24,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:43:24,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:24,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 22:43:24,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:24,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-13 22:43:24,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:24,580 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 24 proven. 11 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-13 22:43:24,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:43:24,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650052010] [2022-07-13 22:43:24,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650052010] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:43:24,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340161252] [2022-07-13 22:43:24,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:24,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:43:24,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:43:24,584 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:43:24,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-13 22:43:25,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:25,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 2683 conjuncts, 103 conjunts are in the unsatisfiable core [2022-07-13 22:43:25,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:43:25,128 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 22:43:29,308 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 22:43:29,308 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 1 case distinctions, treesize of input 17 treesize of output 23 [2022-07-13 22:43:29,313 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 8 treesize of output 4 [2022-07-13 22:43:29,354 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 22:43:29,354 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 1 case distinctions, treesize of input 21 treesize of output 27 [2022-07-13 22:43:29,672 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 22:43:29,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:43:29,679 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-07-13 22:43:29,679 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 32 [2022-07-13 22:43:29,694 INFO L356 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-07-13 22:43:29,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 34 [2022-07-13 22:43:29,697 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 11 treesize of output 7 [2022-07-13 22:43:29,705 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 19 treesize of output 22 [2022-07-13 22:43:29,717 INFO L356 Elim1Store]: treesize reduction 14, result has 39.1 percent of original size [2022-07-13 22:43:29,717 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 1 case distinctions, treesize of input 47 treesize of output 46 [2022-07-13 22:43:29,725 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2022-07-13 22:43:29,730 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 29 treesize of output 23 [2022-07-13 22:43:29,760 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 31 treesize of output 25 [2022-07-13 22:43:30,475 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 20 proven. 41 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-13 22:43:30,476 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:43:31,195 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 22:43:31,195 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2022-07-13 22:43:31,201 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 22:43:31,201 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2022-07-13 22:43:31,423 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_11 (Array Int Int)) (|ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base| Int) (v_ArrVal_2183 Int) (v_arrayElimArr_10 (Array Int Int)) (aux_div_v_ArrVal_2182_40 Int) (v_ArrVal_2176 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base| (store (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base|) 8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base|) (+ |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.offset| 8))) 0 v_ArrVal_2183)) |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base| v_ArrVal_2176) |ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base|) 8) 0)) (< (mod (select (select |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base|) |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.offset|) 18446744073709551616) (mod (select v_arrayElimArr_10 0) 18446744073709551616)) (= (mod (select (select (store (store |c_#memory_int| |ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base| v_arrayElimArr_10) |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base| v_arrayElimArr_11) |ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base|) 0) 18446744073709551616) 0) (not (= (select v_arrayElimArr_11 |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.offset|) (* 18446744073709551616 aux_div_v_ArrVal_2182_40))))) is different from false [2022-07-13 22:43:31,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [340161252] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:43:31,438 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 22:43:31,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 26] total 41 [2022-07-13 22:43:31,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618459222] [2022-07-13 22:43:31,438 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 22:43:31,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-07-13 22:43:31,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:43:31,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-07-13 22:43:31,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=2626, Unknown=27, NotChecked=104, Total=2970 [2022-07-13 22:43:31,440 INFO L87 Difference]: Start difference. First operand 371 states and 473 transitions. Second operand has 41 states, 37 states have (on average 2.891891891891892) internal successors, (107), 37 states have internal predecessors, (107), 16 states have call successors, (23), 5 states have call predecessors, (23), 8 states have return successors, (22), 13 states have call predecessors, (22), 15 states have call successors, (22) [2022-07-13 22:43:36,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:43:36,095 INFO L93 Difference]: Finished difference Result 495 states and 627 transitions. [2022-07-13 22:43:36,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-07-13 22:43:36,095 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 37 states have (on average 2.891891891891892) internal successors, (107), 37 states have internal predecessors, (107), 16 states have call successors, (23), 5 states have call predecessors, (23), 8 states have return successors, (22), 13 states have call predecessors, (22), 15 states have call successors, (22) Word has length 95 [2022-07-13 22:43:36,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:43:36,097 INFO L225 Difference]: With dead ends: 495 [2022-07-13 22:43:36,097 INFO L226 Difference]: Without dead ends: 437 [2022-07-13 22:43:36,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 112 SyntacticMatches, 9 SemanticMatches, 93 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2303 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=675, Invalid=8043, Unknown=28, NotChecked=184, Total=8930 [2022-07-13 22:43:36,100 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 129 mSDsluCounter, 991 mSDsCounter, 0 mSdLazyCounter, 1602 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 1130 SdHoareTripleChecker+Invalid, 2333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 1602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 540 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:43:36,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 1130 Invalid, 2333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 1602 Invalid, 0 Unknown, 540 Unchecked, 1.0s Time] [2022-07-13 22:43:36,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2022-07-13 22:43:36,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 374. [2022-07-13 22:43:36,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 242 states have (on average 1.0991735537190082) internal successors, (266), 249 states have internal predecessors, (266), 97 states have call successors, (97), 33 states have call predecessors, (97), 34 states have return successors, (104), 91 states have call predecessors, (104), 94 states have call successors, (104) [2022-07-13 22:43:36,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 467 transitions. [2022-07-13 22:43:36,196 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 467 transitions. Word has length 95 [2022-07-13 22:43:36,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:43:36,197 INFO L495 AbstractCegarLoop]: Abstraction has 374 states and 467 transitions. [2022-07-13 22:43:36,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 37 states have (on average 2.891891891891892) internal successors, (107), 37 states have internal predecessors, (107), 16 states have call successors, (23), 5 states have call predecessors, (23), 8 states have return successors, (22), 13 states have call predecessors, (22), 15 states have call successors, (22) [2022-07-13 22:43:36,197 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 467 transitions. [2022-07-13 22:43:36,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-13 22:43:36,199 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:43:36,199 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:43:36,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-13 22:43:36,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-07-13 22:43:36,411 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:43:36,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:43:36,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1566240838, now seen corresponding path program 1 times [2022-07-13 22:43:36,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:43:36,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928409677] [2022-07-13 22:43:36,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:36,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:43:36,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:36,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:43:36,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:36,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:43:36,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:36,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:43:36,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:36,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 22:43:36,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:36,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-13 22:43:36,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:36,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 22:43:36,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:36,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-13 22:43:36,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:36,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-13 22:43:36,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:36,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 22:43:36,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:36,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-13 22:43:36,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:36,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-13 22:43:36,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:36,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-13 22:43:36,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:36,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-13 22:43:36,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:36,962 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-07-13 22:43:36,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:43:36,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928409677] [2022-07-13 22:43:36,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928409677] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:43:36,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1718309594] [2022-07-13 22:43:36,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:36,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:43:36,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:43:36,964 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:43:36,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-13 22:43:37,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:37,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 2668 conjuncts, 93 conjunts are in the unsatisfiable core [2022-07-13 22:43:37,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:43:37,544 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 6 treesize of output 5 [2022-07-13 22:43:37,547 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 22:43:37,920 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 20 treesize of output 8 [2022-07-13 22:43:38,445 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 15 treesize of output 18 [2022-07-13 22:43:38,488 INFO L356 Elim1Store]: treesize reduction 65, result has 39.3 percent of original size [2022-07-13 22:43:38,488 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 64 [2022-07-13 22:43:38,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2022-07-13 22:43:38,583 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 5 treesize of output 3 [2022-07-13 22:43:38,624 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 7 treesize of output 5 [2022-07-13 22:43:38,634 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 7 treesize of output 5 [2022-07-13 22:43:38,653 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 24 treesize of output 20 [2022-07-13 22:43:39,894 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 22:43:39,894 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 65 treesize of output 49 [2022-07-13 22:43:39,924 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 12 proven. 55 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-13 22:43:39,925 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:43:40,170 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 22:43:40,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 28 [2022-07-13 22:43:40,175 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 22:43:40,176 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2022-07-13 22:43:40,192 WARN L833 $PredicateComparison]: unable to prove that (and (not (< 9223372036854775807 (mod |c_ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2#1| 18446744073709551616))) (forall ((|ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base| Int) (v_arrayElimArr_13 (Array Int Int)) (|ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base| Int) (v_arrayElimArr_14 (Array Int Int)) (aux_div_v_ArrVal_2301_40 Int)) (or (not (= (select v_arrayElimArr_13 |c_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.offset|) |c_ULTIMATE.start_aws_byte_cursor_advance_~len#1|)) (not (< 9223372036854775807 (mod (select (select (store (store |c_#memory_int| |ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base| v_arrayElimArr_13) |ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base| v_arrayElimArr_14) |c_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base|) |c_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.offset|) 18446744073709551616))) (not (= (* 18446744073709551616 aux_div_v_ArrVal_2301_40) (select v_arrayElimArr_14 |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.offset|)))))) is different from false [2022-07-13 22:43:40,207 WARN L833 $PredicateComparison]: unable to prove that (or (and (not (< 9223372036854775807 (mod |c_ULTIMATE.start_aws_byte_cursor_advance_harness_~len~2#1| 18446744073709551616))) (forall ((|ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base| Int) (v_arrayElimArr_13 (Array Int Int)) (|ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base| Int) (v_arrayElimArr_14 (Array Int Int)) (aux_div_v_ArrVal_2301_40 Int)) (or (not (= (select v_arrayElimArr_13 |c_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.offset|) |c_ULTIMATE.start_aws_byte_cursor_advance_~len#1|)) (not (< 9223372036854775807 (mod (select (select (store (store |c_#memory_int| |ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base| v_arrayElimArr_13) |ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base| v_arrayElimArr_14) |c_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base|) |c_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.offset|) 18446744073709551616))) (not (= (* 18446744073709551616 aux_div_v_ArrVal_2301_40) (select v_arrayElimArr_14 |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.offset|)))))) |c_ULTIMATE.start_aws_byte_cursor_advance_#t~short1082#1|) is different from false [2022-07-13 22:43:40,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1718309594] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:43:40,309 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 22:43:40,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 26] total 38 [2022-07-13 22:43:40,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219487388] [2022-07-13 22:43:40,310 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 22:43:40,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-07-13 22:43:40,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:43:40,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-07-13 22:43:40,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1579, Unknown=2, NotChecked=162, Total=1892 [2022-07-13 22:43:40,311 INFO L87 Difference]: Start difference. First operand 374 states and 467 transitions. Second operand has 38 states, 36 states have (on average 2.5277777777777777) internal successors, (91), 33 states have internal predecessors, (91), 13 states have call successors, (27), 7 states have call predecessors, (27), 8 states have return successors, (26), 10 states have call predecessors, (26), 12 states have call successors, (26) [2022-07-13 22:43:45,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:43:45,411 INFO L93 Difference]: Finished difference Result 490 states and 591 transitions. [2022-07-13 22:43:45,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-07-13 22:43:45,412 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 36 states have (on average 2.5277777777777777) internal successors, (91), 33 states have internal predecessors, (91), 13 states have call successors, (27), 7 states have call predecessors, (27), 8 states have return successors, (26), 10 states have call predecessors, (26), 12 states have call successors, (26) Word has length 101 [2022-07-13 22:43:45,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:43:45,413 INFO L225 Difference]: With dead ends: 490 [2022-07-13 22:43:45,413 INFO L226 Difference]: Without dead ends: 474 [2022-07-13 22:43:45,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 143 SyntacticMatches, 20 SemanticMatches, 83 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2152 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=548, Invalid=6263, Unknown=3, NotChecked=326, Total=7140 [2022-07-13 22:43:45,415 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 171 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 2321 mSolverCounterSat, 225 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 3441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 225 IncrementalHoareTripleChecker+Valid, 2321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 895 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-13 22:43:45,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 779 Invalid, 3441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [225 Valid, 2321 Invalid, 0 Unknown, 895 Unchecked, 1.5s Time] [2022-07-13 22:43:45,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2022-07-13 22:43:45,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 446. [2022-07-13 22:43:45,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 293 states have (on average 1.0887372013651877) internal successors, (319), 300 states have internal predecessors, (319), 107 states have call successors, (107), 45 states have call predecessors, (107), 45 states have return successors, (111), 100 states have call predecessors, (111), 101 states have call successors, (111) [2022-07-13 22:43:45,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 537 transitions. [2022-07-13 22:43:45,500 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 537 transitions. Word has length 101 [2022-07-13 22:43:45,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:43:45,500 INFO L495 AbstractCegarLoop]: Abstraction has 446 states and 537 transitions. [2022-07-13 22:43:45,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 36 states have (on average 2.5277777777777777) internal successors, (91), 33 states have internal predecessors, (91), 13 states have call successors, (27), 7 states have call predecessors, (27), 8 states have return successors, (26), 10 states have call predecessors, (26), 12 states have call successors, (26) [2022-07-13 22:43:45,501 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 537 transitions. [2022-07-13 22:43:45,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-13 22:43:45,502 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:43:45,503 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:43:45,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-07-13 22:43:45,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:43:45,728 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:43:45,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:43:45,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1636607180, now seen corresponding path program 1 times [2022-07-13 22:43:45,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:43:45,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833231089] [2022-07-13 22:43:45,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:45,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:43:45,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:46,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:43:46,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:46,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:43:46,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:46,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:43:46,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:46,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 22:43:46,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:46,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-13 22:43:46,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:46,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 22:43:46,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:46,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-13 22:43:46,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:46,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-13 22:43:46,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:46,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 22:43:46,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:46,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-13 22:43:46,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:46,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-13 22:43:46,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:46,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-13 22:43:46,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:46,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-13 22:43:46,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:46,466 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-07-13 22:43:46,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:43:46,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833231089] [2022-07-13 22:43:46,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833231089] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:43:46,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:43:46,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-07-13 22:43:46,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615904102] [2022-07-13 22:43:46,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:43:46,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-13 22:43:46,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:43:46,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-13 22:43:46,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2022-07-13 22:43:46,470 INFO L87 Difference]: Start difference. First operand 446 states and 537 transitions. Second operand has 17 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 8 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 6 states have call predecessors, (13), 7 states have call successors, (13) [2022-07-13 22:43:47,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:43:47,472 INFO L93 Difference]: Finished difference Result 463 states and 556 transitions. [2022-07-13 22:43:47,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 22:43:47,473 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 8 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 6 states have call predecessors, (13), 7 states have call successors, (13) Word has length 101 [2022-07-13 22:43:47,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:43:47,474 INFO L225 Difference]: With dead ends: 463 [2022-07-13 22:43:47,474 INFO L226 Difference]: Without dead ends: 461 [2022-07-13 22:43:47,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2022-07-13 22:43:47,475 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 97 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 1098 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 1214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 1098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-13 22:43:47,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 339 Invalid, 1214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 1098 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-13 22:43:47,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2022-07-13 22:43:47,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 454. [2022-07-13 22:43:47,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 299 states have (on average 1.0869565217391304) internal successors, (325), 306 states have internal predecessors, (325), 108 states have call successors, (108), 46 states have call predecessors, (108), 46 states have return successors, (112), 101 states have call predecessors, (112), 102 states have call successors, (112) [2022-07-13 22:43:47,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 545 transitions. [2022-07-13 22:43:47,580 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 545 transitions. Word has length 101 [2022-07-13 22:43:47,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:43:47,580 INFO L495 AbstractCegarLoop]: Abstraction has 454 states and 545 transitions. [2022-07-13 22:43:47,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 8 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 6 states have call predecessors, (13), 7 states have call successors, (13) [2022-07-13 22:43:47,580 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 545 transitions. [2022-07-13 22:43:47,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-07-13 22:43:47,582 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:43:47,582 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2022-07-13 22:43:47,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-07-13 22:43:47,583 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:43:47,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:43:47,583 INFO L85 PathProgramCache]: Analyzing trace with hash -326672390, now seen corresponding path program 1 times [2022-07-13 22:43:47,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:43:47,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140327795] [2022-07-13 22:43:47,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:47,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:43:48,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:49,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:43:49,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:49,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:43:49,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:49,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 22:43:49,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:49,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 22:43:49,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:49,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:43:49,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:49,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 22:43:49,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:49,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 22:43:49,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:49,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-13 22:43:49,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:49,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:43:49,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:49,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-13 22:43:49,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:49,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-13 22:43:49,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:49,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-13 22:43:49,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:49,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-13 22:43:49,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:49,737 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 18 proven. 28 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-07-13 22:43:49,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:43:49,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140327795] [2022-07-13 22:43:49,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140327795] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:43:49,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334292930] [2022-07-13 22:43:49,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:49,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:43:49,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:43:49,740 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:43:49,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-07-13 22:43:50,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:50,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 2666 conjuncts, 115 conjunts are in the unsatisfiable core [2022-07-13 22:43:50,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:43:50,247 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 6 treesize of output 5 [2022-07-13 22:43:50,249 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 6 treesize of output 5 [2022-07-13 22:43:50,250 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 6 treesize of output 5 [2022-07-13 22:43:51,040 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2022-07-13 22:43:51,107 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 22:43:51,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:43:51,109 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 22:43:51,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:43:51,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:43:51,112 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 22:43:51,126 INFO L356 Elim1Store]: treesize reduction 34, result has 38.2 percent of original size [2022-07-13 22:43:51,126 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 2 case distinctions, treesize of input 64 treesize of output 41 [2022-07-13 22:43:51,137 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 22:43:51,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:43:51,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:43:51,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:43:51,143 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 22:43:51,144 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 22:43:51,158 INFO L356 Elim1Store]: treesize reduction 30, result has 41.2 percent of original size [2022-07-13 22:43:51,158 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 2 case distinctions, treesize of input 60 treesize of output 37 [2022-07-13 22:43:52,025 INFO L356 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2022-07-13 22:43:52,026 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 16 [2022-07-13 22:43:52,035 INFO L356 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2022-07-13 22:43:52,035 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 20 [2022-07-13 22:43:52,182 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 19 proven. 52 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-07-13 22:43:52,182 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:43:53,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334292930] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:43:53,365 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 22:43:53,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 28] total 49 [2022-07-13 22:43:53,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986370913] [2022-07-13 22:43:53,366 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 22:43:53,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-07-13 22:43:53,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:43:53,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-07-13 22:43:53,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=3003, Unknown=0, NotChecked=0, Total=3192 [2022-07-13 22:43:53,367 INFO L87 Difference]: Start difference. First operand 454 states and 545 transitions. Second operand has 49 states, 42 states have (on average 2.0) internal successors, (84), 46 states have internal predecessors, (84), 20 states have call successors, (28), 3 states have call predecessors, (28), 7 states have return successors, (26), 13 states have call predecessors, (26), 18 states have call successors, (26) [2022-07-13 22:43:57,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:43:57,915 INFO L93 Difference]: Finished difference Result 516 states and 632 transitions. [2022-07-13 22:43:57,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-07-13 22:43:57,916 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 42 states have (on average 2.0) internal successors, (84), 46 states have internal predecessors, (84), 20 states have call successors, (28), 3 states have call predecessors, (28), 7 states have return successors, (26), 13 states have call predecessors, (26), 18 states have call successors, (26) Word has length 102 [2022-07-13 22:43:57,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:43:57,918 INFO L225 Difference]: With dead ends: 516 [2022-07-13 22:43:57,918 INFO L226 Difference]: Without dead ends: 514 [2022-07-13 22:43:57,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 104 SyntacticMatches, 17 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1792 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=473, Invalid=6667, Unknown=0, NotChecked=0, Total=7140 [2022-07-13 22:43:57,920 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 107 mSDsluCounter, 1942 mSDsCounter, 0 mSdLazyCounter, 2955 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 2026 SdHoareTripleChecker+Invalid, 4197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 2955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1113 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-13 22:43:57,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 2026 Invalid, 4197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 2955 Invalid, 0 Unknown, 1113 Unchecked, 2.5s Time] [2022-07-13 22:43:57,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2022-07-13 22:43:58,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 479. [2022-07-13 22:43:58,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 314 states have (on average 1.0828025477707006) internal successors, (340), 321 states have internal predecessors, (340), 116 states have call successors, (116), 48 states have call predecessors, (116), 48 states have return successors, (120), 109 states have call predecessors, (120), 110 states have call successors, (120) [2022-07-13 22:43:58,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 576 transitions. [2022-07-13 22:43:58,029 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 576 transitions. Word has length 102 [2022-07-13 22:43:58,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:43:58,029 INFO L495 AbstractCegarLoop]: Abstraction has 479 states and 576 transitions. [2022-07-13 22:43:58,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 42 states have (on average 2.0) internal successors, (84), 46 states have internal predecessors, (84), 20 states have call successors, (28), 3 states have call predecessors, (28), 7 states have return successors, (26), 13 states have call predecessors, (26), 18 states have call successors, (26) [2022-07-13 22:43:58,030 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 576 transitions. [2022-07-13 22:43:58,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-13 22:43:58,031 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:43:58,032 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2022-07-13 22:43:58,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-07-13 22:43:58,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-07-13 22:43:58,255 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:43:58,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:43:58,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1201612672, now seen corresponding path program 2 times [2022-07-13 22:43:58,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:43:58,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148617942] [2022-07-13 22:43:58,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:43:58,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:43:58,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:58,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:43:58,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:58,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:43:58,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:58,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:43:58,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:58,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 22:43:58,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:58,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-13 22:43:58,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:58,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:43:58,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:58,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 22:43:58,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:58,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:43:58,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:58,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 22:43:58,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:58,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-13 22:43:58,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:58,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-13 22:43:58,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:43:58,976 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-07-13 22:43:58,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:43:58,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148617942] [2022-07-13 22:43:58,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148617942] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:43:58,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:43:58,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-07-13 22:43:58,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745697314] [2022-07-13 22:43:58,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:43:58,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-13 22:43:58,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:43:58,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-13 22:43:58,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2022-07-13 22:43:58,978 INFO L87 Difference]: Start difference. First operand 479 states and 576 transitions. Second operand has 20 states, 19 states have (on average 2.736842105263158) internal successors, (52), 18 states have internal predecessors, (52), 8 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 8 states have call predecessors, (11), 7 states have call successors, (11) [2022-07-13 22:44:00,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:44:00,626 INFO L93 Difference]: Finished difference Result 558 states and 673 transitions. [2022-07-13 22:44:00,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-13 22:44:00,626 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.736842105263158) internal successors, (52), 18 states have internal predecessors, (52), 8 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 8 states have call predecessors, (11), 7 states have call successors, (11) Word has length 101 [2022-07-13 22:44:00,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:44:00,628 INFO L225 Difference]: With dead ends: 558 [2022-07-13 22:44:00,629 INFO L226 Difference]: Without dead ends: 500 [2022-07-13 22:44:00,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=161, Invalid=895, Unknown=0, NotChecked=0, Total=1056 [2022-07-13 22:44:00,630 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 132 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 1550 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 1689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 1550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:44:00,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 562 Invalid, 1689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 1550 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-13 22:44:00,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2022-07-13 22:44:00,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 479. [2022-07-13 22:44:00,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 314 states have (on average 1.0828025477707006) internal successors, (340), 321 states have internal predecessors, (340), 116 states have call successors, (116), 48 states have call predecessors, (116), 48 states have return successors, (119), 109 states have call predecessors, (119), 110 states have call successors, (119) [2022-07-13 22:44:00,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 575 transitions. [2022-07-13 22:44:00,731 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 575 transitions. Word has length 101 [2022-07-13 22:44:00,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:44:00,731 INFO L495 AbstractCegarLoop]: Abstraction has 479 states and 575 transitions. [2022-07-13 22:44:00,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.736842105263158) internal successors, (52), 18 states have internal predecessors, (52), 8 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 8 states have call predecessors, (11), 7 states have call successors, (11) [2022-07-13 22:44:00,731 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 575 transitions. [2022-07-13 22:44:00,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-13 22:44:00,732 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:44:00,732 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2022-07-13 22:44:00,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-07-13 22:44:00,733 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:44:00,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:44:00,733 INFO L85 PathProgramCache]: Analyzing trace with hash -808905162, now seen corresponding path program 1 times [2022-07-13 22:44:00,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:44:00,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856088914] [2022-07-13 22:44:00,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:44:00,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:44:00,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:01,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:44:01,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:01,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:44:01,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:01,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 22:44:01,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:01,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 22:44:01,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:01,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:44:01,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:01,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 22:44:01,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:01,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 22:44:01,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:01,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-13 22:44:01,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:01,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:44:01,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:01,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-13 22:44:01,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:01,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-13 22:44:01,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:01,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-13 22:44:01,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:01,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-13 22:44:01,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:01,056 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2022-07-13 22:44:01,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:44:01,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856088914] [2022-07-13 22:44:01,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856088914] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:44:01,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:44:01,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-13 22:44:01,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994928549] [2022-07-13 22:44:01,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:44:01,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 22:44:01,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:44:01,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 22:44:01,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-13 22:44:01,059 INFO L87 Difference]: Start difference. First operand 479 states and 575 transitions. Second operand has 11 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 6 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-07-13 22:44:01,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:44:01,463 INFO L93 Difference]: Finished difference Result 485 states and 580 transitions. [2022-07-13 22:44:01,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 22:44:01,463 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 6 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 106 [2022-07-13 22:44:01,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:44:01,464 INFO L225 Difference]: With dead ends: 485 [2022-07-13 22:44:01,465 INFO L226 Difference]: Without dead ends: 434 [2022-07-13 22:44:01,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2022-07-13 22:44:01,466 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 52 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 22:44:01,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 780 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 22:44:01,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2022-07-13 22:44:01,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2022-07-13 22:44:01,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 288 states have (on average 1.0763888888888888) internal successors, (310), 294 states have internal predecessors, (310), 100 states have call successors, (100), 44 states have call predecessors, (100), 45 states have return successors, (105), 95 states have call predecessors, (105), 96 states have call successors, (105) [2022-07-13 22:44:01,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 515 transitions. [2022-07-13 22:44:01,578 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 515 transitions. Word has length 106 [2022-07-13 22:44:01,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:44:01,579 INFO L495 AbstractCegarLoop]: Abstraction has 434 states and 515 transitions. [2022-07-13 22:44:01,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 6 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-07-13 22:44:01,579 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 515 transitions. [2022-07-13 22:44:01,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-07-13 22:44:01,580 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:44:01,581 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-13 22:44:01,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-07-13 22:44:01,581 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:44:01,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:44:01,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1821091513, now seen corresponding path program 1 times [2022-07-13 22:44:01,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:44:01,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352986751] [2022-07-13 22:44:01,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:44:01,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:44:01,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:01,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:44:01,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:01,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:44:01,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:01,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:44:01,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:01,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 22:44:01,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:01,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-13 22:44:01,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:01,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:44:01,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:01,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 22:44:01,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:01,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:44:01,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:01,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 22:44:01,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:01,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-13 22:44:01,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:01,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-13 22:44:01,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:01,890 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-07-13 22:44:01,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:44:01,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352986751] [2022-07-13 22:44:01,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352986751] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:44:01,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:44:01,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-13 22:44:01,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169928345] [2022-07-13 22:44:01,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:44:01,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 22:44:01,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:44:01,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 22:44:01,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-07-13 22:44:01,891 INFO L87 Difference]: Start difference. First operand 434 states and 515 transitions. Second operand has 14 states, 13 states have (on average 3.923076923076923) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-07-13 22:44:02,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:44:02,550 INFO L93 Difference]: Finished difference Result 440 states and 520 transitions. [2022-07-13 22:44:02,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-13 22:44:02,551 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.923076923076923) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2022-07-13 22:44:02,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:44:02,552 INFO L225 Difference]: With dead ends: 440 [2022-07-13 22:44:02,552 INFO L226 Difference]: Without dead ends: 438 [2022-07-13 22:44:02,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=527, Unknown=0, NotChecked=0, Total=650 [2022-07-13 22:44:02,553 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 59 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 22:44:02,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 640 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 22:44:02,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2022-07-13 22:44:02,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 438. [2022-07-13 22:44:02,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 291 states have (on average 1.0756013745704467) internal successors, (313), 297 states have internal predecessors, (313), 100 states have call successors, (100), 45 states have call predecessors, (100), 46 states have return successors, (105), 95 states have call predecessors, (105), 96 states have call successors, (105) [2022-07-13 22:44:02,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 518 transitions. [2022-07-13 22:44:02,649 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 518 transitions. Word has length 103 [2022-07-13 22:44:02,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:44:02,650 INFO L495 AbstractCegarLoop]: Abstraction has 438 states and 518 transitions. [2022-07-13 22:44:02,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.923076923076923) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2022-07-13 22:44:02,650 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 518 transitions. [2022-07-13 22:44:02,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-13 22:44:02,651 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:44:02,651 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:44:02,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-07-13 22:44:02,651 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:44:02,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:44:02,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1257386079, now seen corresponding path program 1 times [2022-07-13 22:44:02,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:44:02,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427531615] [2022-07-13 22:44:02,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:44:02,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:44:02,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:03,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:44:03,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:03,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:44:03,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:03,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:44:03,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:03,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 22:44:03,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:03,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-13 22:44:03,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:03,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 22:44:03,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:03,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-13 22:44:03,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:03,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-13 22:44:03,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:03,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 22:44:03,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:03,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-13 22:44:03,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:03,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-13 22:44:03,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:03,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-13 22:44:03,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:03,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-13 22:44:03,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:03,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-13 22:44:03,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:03,279 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 26 proven. 18 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-07-13 22:44:03,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:44:03,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427531615] [2022-07-13 22:44:03,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427531615] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:44:03,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656777484] [2022-07-13 22:44:03,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:44:03,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:44:03,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:44:03,280 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:44:03,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-07-13 22:44:03,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:03,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 2686 conjuncts, 98 conjunts are in the unsatisfiable core [2022-07-13 22:44:03,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:44:03,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 22:44:04,256 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 20 treesize of output 8 [2022-07-13 22:44:04,637 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 22:44:04,638 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 30 [2022-07-13 22:44:04,721 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-07-13 22:44:04,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 12 [2022-07-13 22:44:04,737 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 22:44:04,738 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 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-13 22:44:04,744 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 5 treesize of output 3 [2022-07-13 22:44:05,891 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-13 22:44:05,891 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 38 treesize of output 18 [2022-07-13 22:44:06,024 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 6 proven. 63 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-07-13 22:44:06,025 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:44:06,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656777484] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:44:06,358 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 22:44:06,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 31] total 45 [2022-07-13 22:44:06,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919058482] [2022-07-13 22:44:06,359 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 22:44:06,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-07-13 22:44:06,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:44:06,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-07-13 22:44:06,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=2285, Unknown=0, NotChecked=0, Total=2450 [2022-07-13 22:44:06,360 INFO L87 Difference]: Start difference. First operand 438 states and 518 transitions. Second operand has 45 states, 40 states have (on average 2.425) internal successors, (97), 39 states have internal predecessors, (97), 16 states have call successors, (30), 6 states have call predecessors, (30), 7 states have return successors, (28), 13 states have call predecessors, (28), 14 states have call successors, (28) [2022-07-13 22:44:11,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:44:11,293 INFO L93 Difference]: Finished difference Result 636 states and 750 transitions. [2022-07-13 22:44:11,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2022-07-13 22:44:11,294 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 40 states have (on average 2.425) internal successors, (97), 39 states have internal predecessors, (97), 16 states have call successors, (30), 6 states have call predecessors, (30), 7 states have return successors, (28), 13 states have call predecessors, (28), 14 states have call successors, (28) Word has length 107 [2022-07-13 22:44:11,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:44:11,295 INFO L225 Difference]: With dead ends: 636 [2022-07-13 22:44:11,296 INFO L226 Difference]: Without dead ends: 597 [2022-07-13 22:44:11,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 127 SyntacticMatches, 20 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5345 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1017, Invalid=13745, Unknown=0, NotChecked=0, Total=14762 [2022-07-13 22:44:11,297 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 407 mSDsluCounter, 794 mSDsCounter, 0 mSdLazyCounter, 3265 mSolverCounterSat, 337 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 5417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 337 IncrementalHoareTripleChecker+Valid, 3265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1815 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-13 22:44:11,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 930 Invalid, 5417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [337 Valid, 3265 Invalid, 0 Unknown, 1815 Unchecked, 2.3s Time] [2022-07-13 22:44:11,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2022-07-13 22:44:11,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 498. [2022-07-13 22:44:11,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 338 states have (on average 1.0621301775147929) internal successors, (359), 346 states have internal predecessors, (359), 104 states have call successors, (104), 54 states have call predecessors, (104), 55 states have return successors, (108), 97 states have call predecessors, (108), 99 states have call successors, (108) [2022-07-13 22:44:11,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 571 transitions. [2022-07-13 22:44:11,424 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 571 transitions. Word has length 107 [2022-07-13 22:44:11,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:44:11,425 INFO L495 AbstractCegarLoop]: Abstraction has 498 states and 571 transitions. [2022-07-13 22:44:11,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 40 states have (on average 2.425) internal successors, (97), 39 states have internal predecessors, (97), 16 states have call successors, (30), 6 states have call predecessors, (30), 7 states have return successors, (28), 13 states have call predecessors, (28), 14 states have call successors, (28) [2022-07-13 22:44:11,425 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 571 transitions. [2022-07-13 22:44:11,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-13 22:44:11,426 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:44:11,427 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 5, 5, 5, 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] [2022-07-13 22:44:11,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-07-13 22:44:11,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:44:11,643 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:44:11,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:44:11,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1379697227, now seen corresponding path program 1 times [2022-07-13 22:44:11,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:44:11,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019773017] [2022-07-13 22:44:11,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:44:11,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:44:11,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:12,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:44:12,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:12,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:44:12,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:12,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 22:44:12,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:12,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-13 22:44:12,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:12,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 22:44:12,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:12,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 22:44:12,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:12,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 22:44:12,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:12,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-13 22:44:12,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:12,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:44:12,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:12,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-13 22:44:12,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:12,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-13 22:44:12,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:12,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-13 22:44:12,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:12,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-13 22:44:12,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:12,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-13 22:44:12,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:12,222 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2022-07-13 22:44:12,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:44:12,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019773017] [2022-07-13 22:44:12,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019773017] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:44:12,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:44:12,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-13 22:44:12,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523994363] [2022-07-13 22:44:12,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:44:12,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-13 22:44:12,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:44:12,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-13 22:44:12,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-07-13 22:44:12,223 INFO L87 Difference]: Start difference. First operand 498 states and 571 transitions. Second operand has 13 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 12 states have internal predecessors, (37), 6 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 4 states have call predecessors, (14), 5 states have call successors, (14) [2022-07-13 22:44:12,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:44:12,740 INFO L93 Difference]: Finished difference Result 504 states and 576 transitions. [2022-07-13 22:44:12,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 22:44:12,740 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 12 states have internal predecessors, (37), 6 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 4 states have call predecessors, (14), 5 states have call successors, (14) Word has length 108 [2022-07-13 22:44:12,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:44:12,742 INFO L225 Difference]: With dead ends: 504 [2022-07-13 22:44:12,742 INFO L226 Difference]: Without dead ends: 407 [2022-07-13 22:44:12,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2022-07-13 22:44:12,743 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 24 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 22:44:12,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 680 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 22:44:12,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2022-07-13 22:44:12,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 407. [2022-07-13 22:44:12,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 274 states have (on average 1.0693430656934306) internal successors, (293), 281 states have internal predecessors, (293), 90 states have call successors, (90), 42 states have call predecessors, (90), 42 states have return successors, (94), 83 states have call predecessors, (94), 86 states have call successors, (94) [2022-07-13 22:44:12,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 477 transitions. [2022-07-13 22:44:12,818 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 477 transitions. Word has length 108 [2022-07-13 22:44:12,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:44:12,818 INFO L495 AbstractCegarLoop]: Abstraction has 407 states and 477 transitions. [2022-07-13 22:44:12,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 12 states have internal predecessors, (37), 6 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 4 states have call predecessors, (14), 5 states have call successors, (14) [2022-07-13 22:44:12,819 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 477 transitions. [2022-07-13 22:44:12,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-13 22:44:12,820 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:44:12,820 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 4, 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] [2022-07-13 22:44:12,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-07-13 22:44:12,820 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:44:12,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:44:12,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1880590197, now seen corresponding path program 1 times [2022-07-13 22:44:12,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:44:12,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228781198] [2022-07-13 22:44:12,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:44:12,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:44:13,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:13,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:44:13,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:13,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 22:44:13,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:13,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:44:13,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:13,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-13 22:44:13,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:13,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 22:44:13,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:13,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 22:44:13,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:13,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-13 22:44:13,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:13,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-13 22:44:13,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:13,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-13 22:44:13,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:13,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-13 22:44:13,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:13,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-13 22:44:13,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:13,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-13 22:44:13,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:13,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-13 22:44:13,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:13,474 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 10 proven. 24 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-07-13 22:44:13,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:44:13,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228781198] [2022-07-13 22:44:13,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228781198] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:44:13,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539458163] [2022-07-13 22:44:13,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:44:13,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:44:13,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:44:13,480 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:44:13,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-07-13 22:44:13,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:13,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 2688 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-13 22:44:13,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:44:13,987 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 13 treesize of output 9 [2022-07-13 22:44:13,990 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 13 treesize of output 9 [2022-07-13 22:44:14,277 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-07-13 22:44:14,277 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:44:14,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1539458163] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:44:14,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:44:14,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [10] total 19 [2022-07-13 22:44:14,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410538398] [2022-07-13 22:44:14,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:44:14,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 22:44:14,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:44:14,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 22:44:14,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2022-07-13 22:44:14,279 INFO L87 Difference]: Start difference. First operand 407 states and 477 transitions. Second operand has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-13 22:44:14,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:44:14,449 INFO L93 Difference]: Finished difference Result 419 states and 487 transitions. [2022-07-13 22:44:14,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 22:44:14,450 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 108 [2022-07-13 22:44:14,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:44:14,451 INFO L225 Difference]: With dead ends: 419 [2022-07-13 22:44:14,451 INFO L226 Difference]: Without dead ends: 321 [2022-07-13 22:44:14,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2022-07-13 22:44:14,452 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 37 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:44:14,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 408 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 68 Invalid, 0 Unknown, 49 Unchecked, 0.1s Time] [2022-07-13 22:44:14,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2022-07-13 22:44:14,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2022-07-13 22:44:14,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 211 states have (on average 1.080568720379147) internal successors, (228), 218 states have internal predecessors, (228), 77 states have call successors, (77), 31 states have call predecessors, (77), 32 states have return successors, (82), 71 states have call predecessors, (82), 74 states have call successors, (82) [2022-07-13 22:44:14,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 387 transitions. [2022-07-13 22:44:14,534 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 387 transitions. Word has length 108 [2022-07-13 22:44:14,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:44:14,534 INFO L495 AbstractCegarLoop]: Abstraction has 321 states and 387 transitions. [2022-07-13 22:44:14,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-13 22:44:14,534 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 387 transitions. [2022-07-13 22:44:14,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-13 22:44:14,535 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:44:14,535 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:44:14,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-07-13 22:44:14,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-07-13 22:44:14,736 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:44:14,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:44:14,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1767868658, now seen corresponding path program 1 times [2022-07-13 22:44:14,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:44:14,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771677921] [2022-07-13 22:44:14,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:44:14,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:44:14,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:14,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:44:14,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:14,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:44:14,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:14,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:44:14,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:14,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 22:44:14,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:14,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-13 22:44:14,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:14,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:44:14,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:14,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 22:44:14,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:15,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-13 22:44:15,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:15,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:44:15,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:15,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 22:44:15,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:15,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-13 22:44:15,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:15,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-13 22:44:15,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:15,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-13 22:44:15,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:15,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-13 22:44:15,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:15,085 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-07-13 22:44:15,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:44:15,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771677921] [2022-07-13 22:44:15,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771677921] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:44:15,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848340491] [2022-07-13 22:44:15,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:44:15,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:44:15,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:44:15,092 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:44:15,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-07-13 22:44:15,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:15,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 2712 conjuncts, 66 conjunts are in the unsatisfiable core [2022-07-13 22:44:15,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:44:15,568 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-07-13 22:44:15,661 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 5 treesize of output 3 [2022-07-13 22:44:15,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:44:15,733 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-07-13 22:44:16,056 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-07-13 22:44:16,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-07-13 22:44:16,091 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 17 treesize of output 19 [2022-07-13 22:44:18,178 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 17 treesize of output 19 [2022-07-13 22:44:20,427 INFO L356 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-07-13 22:44:20,428 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 1 [2022-07-13 22:44:20,429 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 62 proven. 11 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-13 22:44:20,430 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:44:20,599 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3024 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_save_byte_from_array_~storage#1.base| v_ArrVal_3024) |c_ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2#1.base|) |c_ULTIMATE.start_aws_byte_cursor_advance_harness_~#cursor~2#1.offset|))) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)))))) is different from false [2022-07-13 22:44:20,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1848340491] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:44:20,604 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 22:44:20,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 20] total 32 [2022-07-13 22:44:20,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213065073] [2022-07-13 22:44:20,604 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 22:44:20,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-13 22:44:20,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:44:20,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-13 22:44:20,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1003, Unknown=2, NotChecked=64, Total=1190 [2022-07-13 22:44:20,605 INFO L87 Difference]: Start difference. First operand 321 states and 387 transitions. Second operand has 32 states, 30 states have (on average 3.433333333333333) internal successors, (103), 28 states have internal predecessors, (103), 11 states have call successors, (28), 8 states have call predecessors, (28), 10 states have return successors, (27), 9 states have call predecessors, (27), 11 states have call successors, (27) [2022-07-13 22:44:23,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:44:23,526 INFO L93 Difference]: Finished difference Result 437 states and 514 transitions. [2022-07-13 22:44:23,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-13 22:44:23,526 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 3.433333333333333) internal successors, (103), 28 states have internal predecessors, (103), 11 states have call successors, (28), 8 states have call predecessors, (28), 10 states have return successors, (27), 9 states have call predecessors, (27), 11 states have call successors, (27) Word has length 114 [2022-07-13 22:44:23,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:44:23,527 INFO L225 Difference]: With dead ends: 437 [2022-07-13 22:44:23,527 INFO L226 Difference]: Without dead ends: 299 [2022-07-13 22:44:23,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 193 SyntacticMatches, 6 SemanticMatches, 50 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=261, Invalid=2290, Unknown=3, NotChecked=98, Total=2652 [2022-07-13 22:44:23,528 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 82 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 1018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 347 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 22:44:23,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 536 Invalid, 1018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 610 Invalid, 0 Unknown, 347 Unchecked, 0.5s Time] [2022-07-13 22:44:23,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2022-07-13 22:44:23,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2022-07-13 22:44:23,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 199 states have (on average 1.07035175879397) internal successors, (213), 205 states have internal predecessors, (213), 68 states have call successors, (68), 30 states have call predecessors, (68), 31 states have return successors, (72), 63 states have call predecessors, (72), 65 states have call successors, (72) [2022-07-13 22:44:23,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 353 transitions. [2022-07-13 22:44:23,578 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 353 transitions. Word has length 114 [2022-07-13 22:44:23,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:44:23,579 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 353 transitions. [2022-07-13 22:44:23,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 3.433333333333333) internal successors, (103), 28 states have internal predecessors, (103), 11 states have call successors, (28), 8 states have call predecessors, (28), 10 states have return successors, (27), 9 states have call predecessors, (27), 11 states have call successors, (27) [2022-07-13 22:44:23,579 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 353 transitions. [2022-07-13 22:44:23,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-13 22:44:23,580 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:44:23,581 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:44:23,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-07-13 22:44:23,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-07-13 22:44:23,795 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:44:23,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:44:23,796 INFO L85 PathProgramCache]: Analyzing trace with hash -329161806, now seen corresponding path program 1 times [2022-07-13 22:44:23,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:44:23,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643381155] [2022-07-13 22:44:23,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:44:23,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:44:23,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:24,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:44:24,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:24,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:44:24,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:24,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:44:24,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:24,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 22:44:24,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:24,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-13 22:44:24,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:24,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 22:44:24,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:24,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-13 22:44:24,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:24,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-13 22:44:24,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:24,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 22:44:24,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:24,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-13 22:44:24,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:24,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-13 22:44:24,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:24,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-13 22:44:24,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:24,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-13 22:44:24,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:24,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-13 22:44:24,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:24,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-13 22:44:24,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:24,468 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2022-07-13 22:44:24,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:44:24,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643381155] [2022-07-13 22:44:24,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643381155] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:44:24,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:44:24,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-07-13 22:44:24,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497932527] [2022-07-13 22:44:24,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:44:24,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-13 22:44:24,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:44:24,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-13 22:44:24,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2022-07-13 22:44:24,470 INFO L87 Difference]: Start difference. First operand 299 states and 353 transitions. Second operand has 17 states, 16 states have (on average 2.6875) internal successors, (43), 15 states have internal predecessors, (43), 9 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (15), 7 states have call predecessors, (15), 7 states have call successors, (15) [2022-07-13 22:44:26,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:44:26,161 INFO L93 Difference]: Finished difference Result 329 states and 388 transitions. [2022-07-13 22:44:26,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-13 22:44:26,166 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.6875) internal successors, (43), 15 states have internal predecessors, (43), 9 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (15), 7 states have call predecessors, (15), 7 states have call successors, (15) Word has length 117 [2022-07-13 22:44:26,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:44:26,167 INFO L225 Difference]: With dead ends: 329 [2022-07-13 22:44:26,167 INFO L226 Difference]: Without dead ends: 313 [2022-07-13 22:44:26,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=167, Invalid=763, Unknown=0, NotChecked=0, Total=930 [2022-07-13 22:44:26,168 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 134 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 1102 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 1245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 1102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-13 22:44:26,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 438 Invalid, 1245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 1102 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-13 22:44:26,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2022-07-13 22:44:26,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 299. [2022-07-13 22:44:26,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 199 states have (on average 1.065326633165829) internal successors, (212), 205 states have internal predecessors, (212), 68 states have call successors, (68), 30 states have call predecessors, (68), 31 states have return successors, (72), 63 states have call predecessors, (72), 65 states have call successors, (72) [2022-07-13 22:44:26,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 352 transitions. [2022-07-13 22:44:26,233 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 352 transitions. Word has length 117 [2022-07-13 22:44:26,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:44:26,234 INFO L495 AbstractCegarLoop]: Abstraction has 299 states and 352 transitions. [2022-07-13 22:44:26,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.6875) internal successors, (43), 15 states have internal predecessors, (43), 9 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (15), 7 states have call predecessors, (15), 7 states have call successors, (15) [2022-07-13 22:44:26,234 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 352 transitions. [2022-07-13 22:44:26,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-13 22:44:26,235 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:44:26,235 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:44:26,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-07-13 22:44:26,235 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:44:26,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:44:26,235 INFO L85 PathProgramCache]: Analyzing trace with hash -110307088, now seen corresponding path program 1 times [2022-07-13 22:44:26,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:44:26,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037823033] [2022-07-13 22:44:26,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:44:26,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:44:26,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:26,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:44:26,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:26,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:44:26,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:26,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:44:26,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:26,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 22:44:26,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:26,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-13 22:44:26,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:26,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 22:44:26,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:26,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-13 22:44:26,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:26,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-13 22:44:26,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:26,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 22:44:26,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:26,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-13 22:44:26,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:26,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-13 22:44:26,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:26,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-13 22:44:26,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:26,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-13 22:44:26,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:26,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-13 22:44:26,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:26,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-13 22:44:26,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:26,707 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2022-07-13 22:44:26,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:44:26,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037823033] [2022-07-13 22:44:26,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037823033] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:44:26,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:44:26,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-13 22:44:26,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657952704] [2022-07-13 22:44:26,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:44:26,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 22:44:26,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:44:26,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 22:44:26,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2022-07-13 22:44:26,709 INFO L87 Difference]: Start difference. First operand 299 states and 352 transitions. Second operand has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 12 states have internal predecessors, (43), 8 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2022-07-13 22:44:27,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:44:27,747 INFO L93 Difference]: Finished difference Result 315 states and 369 transitions. [2022-07-13 22:44:27,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 22:44:27,748 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 12 states have internal predecessors, (43), 8 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) Word has length 117 [2022-07-13 22:44:27,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:44:27,749 INFO L225 Difference]: With dead ends: 315 [2022-07-13 22:44:27,749 INFO L226 Difference]: Without dead ends: 276 [2022-07-13 22:44:27,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2022-07-13 22:44:27,750 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 120 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 22:44:27,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 301 Invalid, 920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 814 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 22:44:27,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2022-07-13 22:44:27,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 269. [2022-07-13 22:44:27,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 185 states have (on average 1.0594594594594595) internal successors, (196), 191 states have internal predecessors, (196), 53 states have call successors, (53), 29 states have call predecessors, (53), 30 states have return successors, (57), 48 states have call predecessors, (57), 50 states have call successors, (57) [2022-07-13 22:44:27,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 306 transitions. [2022-07-13 22:44:27,803 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 306 transitions. Word has length 117 [2022-07-13 22:44:27,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:44:27,804 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 306 transitions. [2022-07-13 22:44:27,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 12 states have internal predecessors, (43), 8 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2022-07-13 22:44:27,804 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 306 transitions. [2022-07-13 22:44:27,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-07-13 22:44:27,804 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:44:27,804 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:44:27,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-07-13 22:44:27,805 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:44:27,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:44:27,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1577419131, now seen corresponding path program 1 times [2022-07-13 22:44:27,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:44:27,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958423718] [2022-07-13 22:44:27,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:44:27,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:44:28,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:28,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:44:28,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:28,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:44:28,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:28,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:44:28,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:28,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 22:44:28,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:28,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-13 22:44:28,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:28,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-13 22:44:28,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:28,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-13 22:44:28,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:28,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-13 22:44:28,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:28,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 22:44:28,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:28,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-13 22:44:28,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:28,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-13 22:44:28,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:28,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-13 22:44:28,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:28,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-13 22:44:28,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:28,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-13 22:44:28,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:28,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-13 22:44:28,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:28,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-13 22:44:28,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:28,535 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2022-07-13 22:44:28,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:44:28,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958423718] [2022-07-13 22:44:28,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958423718] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:44:28,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:44:28,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-07-13 22:44:28,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829895942] [2022-07-13 22:44:28,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:44:28,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-13 22:44:28,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:44:28,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-13 22:44:28,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2022-07-13 22:44:28,537 INFO L87 Difference]: Start difference. First operand 269 states and 306 transitions. Second operand has 16 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 7 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 5 states have call predecessors, (16), 6 states have call successors, (16) [2022-07-13 22:44:29,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:44:29,355 INFO L93 Difference]: Finished difference Result 277 states and 313 transitions. [2022-07-13 22:44:29,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 22:44:29,355 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 7 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 5 states have call predecessors, (16), 6 states have call successors, (16) Word has length 119 [2022-07-13 22:44:29,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:44:29,356 INFO L225 Difference]: With dead ends: 277 [2022-07-13 22:44:29,356 INFO L226 Difference]: Without dead ends: 190 [2022-07-13 22:44:29,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2022-07-13 22:44:29,357 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 60 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 1015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 22:44:29,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 266 Invalid, 1015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 950 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 22:44:29,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-07-13 22:44:29,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2022-07-13 22:44:29,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 129 states have (on average 1.0775193798449612) internal successors, (139), 134 states have internal predecessors, (139), 41 states have call successors, (41), 19 states have call predecessors, (41), 19 states have return successors, (44), 36 states have call predecessors, (44), 38 states have call successors, (44) [2022-07-13 22:44:29,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 224 transitions. [2022-07-13 22:44:29,398 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 224 transitions. Word has length 119 [2022-07-13 22:44:29,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:44:29,398 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 224 transitions. [2022-07-13 22:44:29,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 7 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 5 states have call predecessors, (16), 6 states have call successors, (16) [2022-07-13 22:44:29,398 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 224 transitions. [2022-07-13 22:44:29,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-13 22:44:29,399 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:44:29,399 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 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] [2022-07-13 22:44:29,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-07-13 22:44:29,399 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:44:29,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:44:29,399 INFO L85 PathProgramCache]: Analyzing trace with hash -362342817, now seen corresponding path program 2 times [2022-07-13 22:44:29,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:44:29,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189719510] [2022-07-13 22:44:29,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:44:29,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:44:29,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:29,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:44:29,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:29,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:44:29,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:29,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:44:29,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:29,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 22:44:29,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:29,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-13 22:44:29,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:29,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:44:29,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:29,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 22:44:29,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:29,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:44:29,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:29,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 22:44:29,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:29,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-13 22:44:29,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:29,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-13 22:44:29,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:29,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-13 22:44:29,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:29,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-13 22:44:29,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:29,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-13 22:44:29,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:29,871 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 24 proven. 29 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-13 22:44:29,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:44:29,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189719510] [2022-07-13 22:44:29,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189719510] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:44:29,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769264769] [2022-07-13 22:44:29,872 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 22:44:29,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:44:29,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:44:29,873 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:44:29,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-07-13 22:44:30,669 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 22:44:30,670 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 22:44:30,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 2734 conjuncts, 71 conjunts are in the unsatisfiable core [2022-07-13 22:44:30,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:44:30,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-07-13 22:44:30,774 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-13 22:44:30,774 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-13 22:44:30,858 INFO L356 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2022-07-13 22:44:30,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 30 [2022-07-13 22:44:30,910 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-13 22:44:30,911 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-13 22:44:33,233 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 22:44:33,233 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 11 [2022-07-13 22:44:33,250 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 26 treesize of output 26 [2022-07-13 22:44:37,555 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 74 proven. 14 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-13 22:44:37,555 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:44:37,974 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3267 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base| v_ArrVal_3267) |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.base|) |c_ULTIMATE.start_aws_byte_cursor_advance_~cursor#1.offset|))) (<= .cse0 (+ 18446744073709551615 (* 18446744073709551616 (div (+ (- 1) .cse0) 18446744073709551616)))))) is different from false [2022-07-13 22:44:38,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769264769] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:44:38,034 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 22:44:38,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 33 [2022-07-13 22:44:38,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417399477] [2022-07-13 22:44:38,034 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 22:44:38,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-13 22:44:38,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:44:38,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-13 22:44:38,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1480, Unknown=4, NotChecked=78, Total=1722 [2022-07-13 22:44:38,036 INFO L87 Difference]: Start difference. First operand 190 states and 224 transitions. Second operand has 33 states, 30 states have (on average 4.1) internal successors, (123), 29 states have internal predecessors, (123), 10 states have call successors, (28), 7 states have call predecessors, (28), 10 states have return successors, (27), 7 states have call predecessors, (27), 10 states have call successors, (27) [2022-07-13 22:44:43,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:44:43,043 INFO L93 Difference]: Finished difference Result 345 states and 413 transitions. [2022-07-13 22:44:43,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-13 22:44:43,043 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 4.1) internal successors, (123), 29 states have internal predecessors, (123), 10 states have call successors, (28), 7 states have call predecessors, (28), 10 states have return successors, (27), 7 states have call predecessors, (27), 10 states have call successors, (27) Word has length 120 [2022-07-13 22:44:43,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:44:43,044 INFO L225 Difference]: With dead ends: 345 [2022-07-13 22:44:43,044 INFO L226 Difference]: Without dead ends: 263 [2022-07-13 22:44:43,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 172 SyntacticMatches, 14 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1005 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=287, Invalid=2681, Unknown=6, NotChecked=106, Total=3080 [2022-07-13 22:44:43,045 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 199 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 1748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 778 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 22:44:43,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 811 Invalid, 1748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 887 Invalid, 0 Unknown, 778 Unchecked, 0.6s Time] [2022-07-13 22:44:43,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-07-13 22:44:43,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 206. [2022-07-13 22:44:43,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 144 states have (on average 1.0694444444444444) internal successors, (154), 149 states have internal predecessors, (154), 41 states have call successors, (41), 20 states have call predecessors, (41), 20 states have return successors, (43), 36 states have call predecessors, (43), 38 states have call successors, (43) [2022-07-13 22:44:43,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 238 transitions. [2022-07-13 22:44:43,076 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 238 transitions. Word has length 120 [2022-07-13 22:44:43,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:44:43,076 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 238 transitions. [2022-07-13 22:44:43,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 4.1) internal successors, (123), 29 states have internal predecessors, (123), 10 states have call successors, (28), 7 states have call predecessors, (28), 10 states have return successors, (27), 7 states have call predecessors, (27), 10 states have call successors, (27) [2022-07-13 22:44:43,076 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 238 transitions. [2022-07-13 22:44:43,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-13 22:44:43,077 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:44:43,077 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 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] [2022-07-13 22:44:43,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-07-13 22:44:43,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-07-13 22:44:43,277 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:44:43,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:44:43,278 INFO L85 PathProgramCache]: Analyzing trace with hash -913789417, now seen corresponding path program 1 times [2022-07-13 22:44:43,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:44:43,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098123800] [2022-07-13 22:44:43,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:44:43,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:44:43,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:43,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:44:43,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:43,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:44:43,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:43,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:44:43,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:43,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 22:44:43,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:43,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-13 22:44:43,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:43,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:44:43,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:43,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 22:44:43,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:43,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:44:43,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:43,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 22:44:43,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:43,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-13 22:44:43,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:43,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-13 22:44:43,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:43,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-13 22:44:43,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:43,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-13 22:44:43,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:43,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-13 22:44:43,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:43,750 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-07-13 22:44:43,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:44:43,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098123800] [2022-07-13 22:44:43,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098123800] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:44:43,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:44:43,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-13 22:44:43,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243932957] [2022-07-13 22:44:43,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:44:43,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-13 22:44:43,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:44:43,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-13 22:44:43,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2022-07-13 22:44:43,751 INFO L87 Difference]: Start difference. First operand 206 states and 238 transitions. Second operand has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 14 states have internal predecessors, (47), 8 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2022-07-13 22:44:44,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:44:44,506 INFO L93 Difference]: Finished difference Result 258 states and 304 transitions. [2022-07-13 22:44:44,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 22:44:44,506 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 14 states have internal predecessors, (47), 8 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) Word has length 120 [2022-07-13 22:44:44,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:44:44,507 INFO L225 Difference]: With dead ends: 258 [2022-07-13 22:44:44,507 INFO L226 Difference]: Without dead ends: 230 [2022-07-13 22:44:44,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2022-07-13 22:44:44,508 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 78 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 22:44:44,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 168 Invalid, 941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 22:44:44,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-07-13 22:44:44,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 216. [2022-07-13 22:44:44,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 148 states have (on average 1.0608108108108107) internal successors, (157), 153 states have internal predecessors, (157), 47 states have call successors, (47), 20 states have call predecessors, (47), 20 states have return successors, (49), 42 states have call predecessors, (49), 44 states have call successors, (49) [2022-07-13 22:44:44,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 253 transitions. [2022-07-13 22:44:44,555 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 253 transitions. Word has length 120 [2022-07-13 22:44:44,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:44:44,555 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 253 transitions. [2022-07-13 22:44:44,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 14 states have internal predecessors, (47), 8 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2022-07-13 22:44:44,555 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 253 transitions. [2022-07-13 22:44:44,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-13 22:44:44,556 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:44:44,556 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 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] [2022-07-13 22:44:44,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-07-13 22:44:44,556 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:44:44,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:44:44,556 INFO L85 PathProgramCache]: Analyzing trace with hash -843423075, now seen corresponding path program 1 times [2022-07-13 22:44:44,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:44:44,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566977193] [2022-07-13 22:44:44,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:44:44,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:44:44,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:45,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:44:45,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:45,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 22:44:45,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:45,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:44:45,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:45,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-13 22:44:45,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:45,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-13 22:44:45,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:45,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-13 22:44:45,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:45,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 22:44:45,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:45,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 22:44:45,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:45,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 22:44:45,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:45,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-13 22:44:45,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:45,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-13 22:44:45,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:45,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-13 22:44:45,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:45,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-13 22:44:45,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:45,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-13 22:44:45,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:45,270 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 30 proven. 28 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-13 22:44:45,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:44:45,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566977193] [2022-07-13 22:44:45,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566977193] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:44:45,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411257481] [2022-07-13 22:44:45,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:44:45,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:44:45,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:44:45,272 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:44:45,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-07-13 22:44:45,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:44:45,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 2764 conjuncts, 116 conjunts are in the unsatisfiable core [2022-07-13 22:44:45,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:44:45,783 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-07-13 22:44:45,906 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 5 treesize of output 3 [2022-07-13 22:44:45,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:44:45,967 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-07-13 22:44:46,032 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 13 treesize of output 9 [2022-07-13 22:44:46,035 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 13 treesize of output 9 [2022-07-13 22:44:47,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:44:47,426 INFO L356 Elim1Store]: treesize reduction 98, result has 24.6 percent of original size [2022-07-13 22:44:47,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 34 treesize of output 53 [2022-07-13 22:44:47,539 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 27 [2022-07-13 22:44:47,551 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 27 [2022-07-13 22:44:49,760 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 27 [2022-07-13 22:44:49,765 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 27 [2022-07-13 22:44:49,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:44:49,859 INFO L356 Elim1Store]: treesize reduction 42, result has 27.6 percent of original size [2022-07-13 22:44:49,859 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 30 [2022-07-13 22:44:54,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:44:54,169 INFO L356 Elim1Store]: treesize reduction 40, result has 29.8 percent of original size [2022-07-13 22:44:54,169 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 26 treesize of output 32 [2022-07-13 22:44:54,237 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 22:44:54,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:44:54,239 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-07-13 22:44:54,243 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 22:44:54,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:44:54,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2022-07-13 22:44:54,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 38 [2022-07-13 22:44:54,256 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 13 treesize of output 9 [2022-07-13 22:44:54,260 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 38 [2022-07-13 22:44:54,265 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 13 treesize of output 9 [2022-07-13 22:44:56,317 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_22| Int)) (and (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_22|) 8) (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_24|) 8)) (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_24|) 8) (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_22|) 8)) (not (= |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_22| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_24|)))) is different from true [2022-07-13 22:45:03,442 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_25| Int) (|v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_23| Int)) (and (not (= |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_23| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_25|)) (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_25|) 8) (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_23|) 8)) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_25|) 8) (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_23|) 8)))) is different from true [2022-07-13 22:45:09,674 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_26| Int) (|v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_24| Int)) (and (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_26|) 8) (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_24|) 8)) (not (= |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_24| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_26|)) (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_24|) 8) (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_26|) 8)))) is different from true [2022-07-13 22:45:11,780 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_27| Int) (|v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_25| Int)) (and (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_27|) 8) (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_25|) 8)) (not (= |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_25| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_27|)) (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_25|) 8) (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_BEFORE_CALL_27|) 8)))) is different from true [2022-07-13 22:45:14,021 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#rv~14#1.offset_BEFORE_CALL_19| Int) (|v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#rv~14#1.base_BEFORE_CALL_21| Int) (|v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_35| Int) (|v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_26| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_35|) 8)) (.cse1 (+ |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#rv~14#1.offset_BEFORE_CALL_19| 8)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_35|) 8))) (and (not (= |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_35| |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#rv~14#1.base_BEFORE_CALL_21|)) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_26|) 8) .cse0) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#rv~14#1.base_BEFORE_CALL_21|) .cse1) .cse0) (= .cse2 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#rv~14#1.base_BEFORE_CALL_21|) .cse1)) (not (= |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_26| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_35|)) (= .cse2 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_26|) 8))))) is different from true [2022-07-13 22:45:16,198 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#rv~14#1.base_BEFORE_CALL_22| Int) (|v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_35| Int) (|v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#rv~14#1.offset_BEFORE_CALL_20| Int) (|v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_27| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_35|) 8)) (.cse1 (+ |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#rv~14#1.offset_BEFORE_CALL_20| 8)) (.cse2 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_35|) 8))) (and (= .cse0 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_27|) 8)) (= .cse0 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#rv~14#1.base_BEFORE_CALL_22|) .cse1)) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#rv~14#1.base_BEFORE_CALL_22|) .cse1) .cse2) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_27|) 8) .cse2) (not (= |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_35| |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#rv~14#1.base_BEFORE_CALL_22|)) (not (= |v_ULTIMATE.start_aws_byte_cursor_advance_harness_~#old~0#1.base_BEFORE_CALL_27| |v_ULTIMATE.start_aws_byte_cursor_advance_~#rv~6#1.base_35|))))) is different from true [2022-07-13 22:45:16,357 INFO L356 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-07-13 22:45:16,357 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 13 [2022-07-13 22:45:16,362 INFO L356 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-07-13 22:45:16,362 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 13 [2022-07-13 22:45:18,473 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 33 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 72 not checked. [2022-07-13 22:45:18,474 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:45:19,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1411257481] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:45:19,742 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 22:45:19,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 33] total 49 [2022-07-13 22:45:19,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765646339] [2022-07-13 22:45:19,742 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 22:45:19,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-07-13 22:45:19,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:45:19,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-07-13 22:45:19,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=2127, Unknown=9, NotChecked=582, Total=2862 [2022-07-13 22:45:19,743 INFO L87 Difference]: Start difference. First operand 216 states and 253 transitions. Second operand has 49 states, 44 states have (on average 3.340909090909091) internal successors, (147), 44 states have internal predecessors, (147), 17 states have call successors, (29), 14 states have call predecessors, (29), 14 states have return successors, (27), 14 states have call predecessors, (27), 16 states have call successors, (27)