./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_cursor_left_trim_pred_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5f08f0f0 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_left_trim_pred_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 df7033dfc83b180e9cf25def7ed6e49b1b8e99adfb4ac0289552069b1c368159 --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5f08f0f [2021-11-05 12:44:15,446 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-05 12:44:15,448 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-05 12:44:15,468 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-05 12:44:15,469 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-05 12:44:15,470 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-05 12:44:15,470 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-05 12:44:15,472 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-05 12:44:15,473 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-05 12:44:15,473 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-05 12:44:15,480 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-05 12:44:15,481 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-05 12:44:15,482 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-05 12:44:15,483 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-05 12:44:15,485 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-05 12:44:15,486 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-05 12:44:15,488 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-05 12:44:15,490 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-05 12:44:15,492 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-05 12:44:15,496 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-05 12:44:15,500 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-05 12:44:15,501 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-05 12:44:15,504 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-05 12:44:15,515 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-05 12:44:15,516 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-05 12:44:15,517 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-05 12:44:15,517 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-05 12:44:15,517 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-05 12:44:15,518 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-05 12:44:15,518 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-05 12:44:15,518 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-05 12:44:15,519 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-05 12:44:15,520 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-05 12:44:15,520 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-05 12:44:15,521 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-05 12:44:15,521 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-05 12:44:15,521 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-05 12:44:15,522 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-05 12:44:15,522 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-05 12:44:15,522 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-05 12:44:15,523 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-05 12:44:15,536 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-05 12:44:15,561 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-05 12:44:15,562 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-05 12:44:15,562 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-05 12:44:15,562 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-05 12:44:15,563 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-05 12:44:15,563 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-05 12:44:15,563 INFO L138 SettingsManager]: * Use SBE=true [2021-11-05 12:44:15,564 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-05 12:44:15,564 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-05 12:44:15,564 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-05 12:44:15,564 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-05 12:44:15,564 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-05 12:44:15,564 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-05 12:44:15,564 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-05 12:44:15,565 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-05 12:44:15,565 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-05 12:44:15,565 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-05 12:44:15,565 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-05 12:44:15,572 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-05 12:44:15,572 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-05 12:44:15,573 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-05 12:44:15,573 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-05 12:44:15,573 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-05 12:44:15,573 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-05 12:44:15,573 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-05 12:44:15,573 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-05 12:44:15,573 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-05 12:44:15,574 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-05 12:44:15,574 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-05 12:44:15,574 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 -> df7033dfc83b180e9cf25def7ed6e49b1b8e99adfb4ac0289552069b1c368159 [2021-11-05 12:44:15,827 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-05 12:44:15,846 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-05 12:44:15,849 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-05 12:44:15,850 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-05 12:44:15,851 INFO L275 PluginConnector]: CDTParser initialized [2021-11-05 12:44:15,852 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_left_trim_pred_harness.i [2021-11-05 12:44:15,894 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b023bea49/ee8e280ce50e4e72a1d7cb809962f7f0/FLAG73b960abe [2021-11-05 12:44:16,382 INFO L306 CDTParser]: Found 1 translation units. [2021-11-05 12:44:16,382 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_left_trim_pred_harness.i [2021-11-05 12:44:16,417 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b023bea49/ee8e280ce50e4e72a1d7cb809962f7f0/FLAG73b960abe [2021-11-05 12:44:16,646 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b023bea49/ee8e280ce50e4e72a1d7cb809962f7f0 [2021-11-05 12:44:16,648 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-05 12:44:16,649 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-05 12:44:16,650 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-05 12:44:16,650 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-05 12:44:16,669 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-05 12:44:16,670 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 12:44:16" (1/1) ... [2021-11-05 12:44:16,672 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30547c8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 12:44:16, skipping insertion in model container [2021-11-05 12:44:16,672 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 12:44:16" (1/1) ... [2021-11-05 12:44:16,676 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-05 12:44:16,763 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-05 12:44:17,016 WARN L228 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_left_trim_pred_harness.i[4504,4517] [2021-11-05 12:44:17,022 WARN L228 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_left_trim_pred_harness.i[4564,4577] [2021-11-05 12:44:17,038 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-05 12:44:17,042 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-05 12:44:17,564 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:44:17,567 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:44:17,567 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:44:17,568 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:44:17,569 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:44:17,576 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:44:17,579 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:44:17,581 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:44:17,581 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:44:17,777 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-05 12:44:17,778 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-05 12:44:17,779 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-05 12:44:17,783 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-05 12:44:17,784 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-05 12:44:17,785 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-05 12:44:17,785 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-05 12:44:17,786 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-05 12:44:17,786 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-05 12:44:17,786 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-05 12:44:17,860 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-05 12:44:17,927 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:44:17,928 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:44:17,960 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-05 12:44:17,998 INFO L203 MainTranslator]: Completed pre-run [2021-11-05 12:44:18,019 WARN L228 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_left_trim_pred_harness.i[4504,4517] [2021-11-05 12:44:18,022 WARN L228 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_left_trim_pred_harness.i[4564,4577] [2021-11-05 12:44:18,024 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-05 12:44:18,024 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-05 12:44:18,068 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:44:18,070 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:44:18,071 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:44:18,071 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:44:18,078 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:44:18,083 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:44:18,088 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:44:18,091 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:44:18,091 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:44:18,149 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-05 12:44:18,150 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-05 12:44:18,150 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-05 12:44:18,151 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-05 12:44:18,151 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-05 12:44:18,151 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-05 12:44:18,152 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-05 12:44:18,152 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-05 12:44:18,152 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-05 12:44:18,153 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-05 12:44:18,168 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-05 12:44:18,221 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:44:18,222 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-05 12:44:18,248 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-05 12:44:18,415 INFO L208 MainTranslator]: Completed translation [2021-11-05 12:44:18,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 12:44:18 WrapperNode [2021-11-05 12:44:18,415 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-05 12:44:18,416 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-05 12:44:18,416 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-05 12:44:18,416 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-05 12:44:18,421 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 12:44:18" (1/1) ... [2021-11-05 12:44:18,506 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 12:44:18" (1/1) ... [2021-11-05 12:44:18,579 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-05 12:44:18,579 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-05 12:44:18,580 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-05 12:44:18,580 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-05 12:44:18,587 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 12:44:18" (1/1) ... [2021-11-05 12:44:18,587 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 12:44:18" (1/1) ... [2021-11-05 12:44:18,601 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 12:44:18" (1/1) ... [2021-11-05 12:44:18,602 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 12:44:18" (1/1) ... [2021-11-05 12:44:18,648 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 12:44:18" (1/1) ... [2021-11-05 12:44:18,655 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 12:44:18" (1/1) ... [2021-11-05 12:44:18,668 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 12:44:18" (1/1) ... [2021-11-05 12:44:18,681 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-05 12:44:18,687 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-05 12:44:18,688 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-05 12:44:18,688 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-05 12:44:18,688 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 12:44:18" (1/1) ... [2021-11-05 12:44:18,707 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-05 12:44:18,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 12:44:18,730 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-05 12:44:18,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-05 12:44:18,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-05 12:44:18,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-05 12:44:18,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-05 12:44:18,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-05 12:44:18,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-05 12:44:18,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-05 12:44:18,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-05 12:44:18,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-05 12:44:18,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-05 12:44:18,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-05 12:44:18,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-05 12:44:26,067 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-05 12:44:26,067 INFO L299 CfgBuilder]: Removed 61 assume(true) statements. [2021-11-05 12:44:26,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 12:44:26 BoogieIcfgContainer [2021-11-05 12:44:26,069 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-05 12:44:26,070 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-05 12:44:26,070 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-05 12:44:26,072 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-05 12:44:26,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 12:44:16" (1/3) ... [2021-11-05 12:44:26,072 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46ee07b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 12:44:26, skipping insertion in model container [2021-11-05 12:44:26,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 12:44:18" (2/3) ... [2021-11-05 12:44:26,073 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46ee07b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 12:44:26, skipping insertion in model container [2021-11-05 12:44:26,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 12:44:26" (3/3) ... [2021-11-05 12:44:26,074 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_cursor_left_trim_pred_harness.i [2021-11-05 12:44:26,077 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-05 12:44:26,077 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2021-11-05 12:44:26,105 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-05 12:44:26,109 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-05 12:44:26,110 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-11-05 12:44:26,120 INFO L276 IsEmpty]: Start isEmpty. Operand has 124 states, 118 states have (on average 1.4491525423728813) internal successors, (171), 123 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:44:26,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-05 12:44:26,124 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:44:26,125 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 12:44:26,125 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-05 12:44:26,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:44:26,129 INFO L85 PathProgramCache]: Analyzing trace with hash 960385600, now seen corresponding path program 1 times [2021-11-05 12:44:26,135 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:44:26,135 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323380349] [2021-11-05 12:44:26,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:44:26,136 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:44:26,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:44:26,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 12:44:26,596 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:44:26,596 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323380349] [2021-11-05 12:44:26,599 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323380349] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:44:26,600 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:44:26,600 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-05 12:44:26,601 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552297509] [2021-11-05 12:44:26,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:44:26,611 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-05 12:44:26,611 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:44:26,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-05 12:44:26,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-05 12:44:26,641 INFO L87 Difference]: Start difference. First operand has 124 states, 118 states have (on average 1.4491525423728813) internal successors, (171), 123 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:44:26,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:44:26,661 INFO L93 Difference]: Finished difference Result 244 states and 337 transitions. [2021-11-05 12:44:26,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-05 12:44:26,665 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-11-05 12:44:26,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:44:26,671 INFO L225 Difference]: With dead ends: 244 [2021-11-05 12:44:26,671 INFO L226 Difference]: Without dead ends: 117 [2021-11-05 12:44:26,673 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.04ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-05 12:44:26,679 INFO L933 BasicCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.00ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.31ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.00ms IncrementalHoareTripleChecker+Time [2021-11-05 12:44:26,681 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 1.31ms Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.00ms Time] [2021-11-05 12:44:26,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-11-05 12:44:26,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2021-11-05 12:44:26,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 112 states have (on average 1.3392857142857142) internal successors, (150), 116 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:44:26,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 150 transitions. [2021-11-05 12:44:26,708 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 150 transitions. Word has length 30 [2021-11-05 12:44:26,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:44:26,708 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 150 transitions. [2021-11-05 12:44:26,708 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:44:26,709 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 150 transitions. [2021-11-05 12:44:26,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-05 12:44:26,709 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:44:26,710 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 12:44:26,710 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-05 12:44:26,710 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-05 12:44:26,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:44:26,711 INFO L85 PathProgramCache]: Analyzing trace with hash -649638665, now seen corresponding path program 1 times [2021-11-05 12:44:26,711 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:44:26,711 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385661619] [2021-11-05 12:44:26,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:44:26,712 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:44:26,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:44:26,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 12:44:26,932 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:44:26,932 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385661619] [2021-11-05 12:44:26,932 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385661619] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:44:26,932 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:44:26,933 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-05 12:44:26,933 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294360213] [2021-11-05 12:44:26,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:44:26,934 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 12:44:26,934 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:44:26,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 12:44:26,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 12:44:26,934 INFO L87 Difference]: Start difference. First operand 117 states and 150 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:44:27,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:44:27,119 INFO L93 Difference]: Finished difference Result 213 states and 273 transitions. [2021-11-05 12:44:27,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 12:44:27,121 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-11-05 12:44:27,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:44:27,122 INFO L225 Difference]: With dead ends: 213 [2021-11-05 12:44:27,122 INFO L226 Difference]: Without dead ends: 117 [2021-11-05 12:44:27,123 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 49.94ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 12:44:27,123 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 208 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 106.97ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.23ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 141.10ms IncrementalHoareTripleChecker+Time [2021-11-05 12:44:27,124 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 188 Invalid, 39 Unknown, 0 Unchecked, 3.23ms Time], IncrementalHoareTripleChecker [7 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 141.10ms Time] [2021-11-05 12:44:27,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-11-05 12:44:27,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2021-11-05 12:44:27,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 112 states have (on average 1.3125) internal successors, (147), 116 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:44:27,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 147 transitions. [2021-11-05 12:44:27,133 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 147 transitions. Word has length 32 [2021-11-05 12:44:27,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:44:27,133 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 147 transitions. [2021-11-05 12:44:27,134 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:44:27,134 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 147 transitions. [2021-11-05 12:44:27,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-05 12:44:27,134 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:44:27,135 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 12:44:27,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-05 12:44:27,135 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-05 12:44:27,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:44:27,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1150788759, now seen corresponding path program 1 times [2021-11-05 12:44:27,136 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:44:27,136 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374583922] [2021-11-05 12:44:27,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:44:27,136 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:44:27,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:44:27,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 12:44:27,490 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:44:27,491 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374583922] [2021-11-05 12:44:27,491 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374583922] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:44:27,491 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:44:27,491 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-05 12:44:27,491 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075754601] [2021-11-05 12:44:27,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:44:27,491 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-05 12:44:27,491 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:44:27,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-05 12:44:27,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-05 12:44:27,492 INFO L87 Difference]: Start difference. First operand 117 states and 147 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:44:27,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:44:27,736 INFO L93 Difference]: Finished difference Result 174 states and 217 transitions. [2021-11-05 12:44:27,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-05 12:44:27,737 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-05 12:44:27,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:44:27,737 INFO L225 Difference]: With dead ends: 174 [2021-11-05 12:44:27,737 INFO L226 Difference]: Without dead ends: 117 [2021-11-05 12:44:27,738 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 133.55ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-05 12:44:27,738 INFO L933 BasicCegarLoop]: 133 mSDtfsCounter, 297 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 125.01ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.23ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 147.61ms IncrementalHoareTripleChecker+Time [2021-11-05 12:44:27,739 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [297 Valid, 214 Invalid, 43 Unknown, 0 Unchecked, 2.23ms Time], IncrementalHoareTripleChecker [5 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 147.61ms Time] [2021-11-05 12:44:27,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-11-05 12:44:27,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2021-11-05 12:44:27,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 112 states have (on average 1.3035714285714286) internal successors, (146), 116 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:44:27,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 146 transitions. [2021-11-05 12:44:27,747 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 146 transitions. Word has length 36 [2021-11-05 12:44:27,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:44:27,748 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 146 transitions. [2021-11-05 12:44:27,748 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:44:27,748 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 146 transitions. [2021-11-05 12:44:27,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-05 12:44:27,749 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:44:27,749 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 12:44:27,749 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-05 12:44:27,749 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-05 12:44:27,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:44:27,750 INFO L85 PathProgramCache]: Analyzing trace with hash 410162962, now seen corresponding path program 1 times [2021-11-05 12:44:27,750 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:44:27,750 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234068645] [2021-11-05 12:44:27,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:44:27,751 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:44:28,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:44:28,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 12:44:28,265 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:44:28,265 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234068645] [2021-11-05 12:44:28,265 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234068645] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:44:28,266 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:44:28,266 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-05 12:44:28,266 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126812821] [2021-11-05 12:44:28,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:44:28,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-05 12:44:28,266 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:44:28,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-05 12:44:28,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-05 12:44:28,267 INFO L87 Difference]: Start difference. First operand 117 states and 146 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:44:28,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:44:28,930 INFO L93 Difference]: Finished difference Result 216 states and 261 transitions. [2021-11-05 12:44:28,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-05 12:44:28,931 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-11-05 12:44:28,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:44:28,932 INFO L225 Difference]: With dead ends: 216 [2021-11-05 12:44:28,932 INFO L226 Difference]: Without dead ends: 208 [2021-11-05 12:44:28,933 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 218.10ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-11-05 12:44:28,933 INFO L933 BasicCegarLoop]: 149 mSDtfsCounter, 176 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 461.39ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.41ms SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 503.94ms IncrementalHoareTripleChecker+Time [2021-11-05 12:44:28,935 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [176 Valid, 570 Invalid, 226 Unknown, 0 Unchecked, 5.41ms Time], IncrementalHoareTripleChecker [51 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 503.94ms Time] [2021-11-05 12:44:28,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2021-11-05 12:44:28,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 133. [2021-11-05 12:44:28,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 128 states have (on average 1.265625) internal successors, (162), 132 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:44:28,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 162 transitions. [2021-11-05 12:44:28,947 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 162 transitions. Word has length 38 [2021-11-05 12:44:28,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:44:28,947 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 162 transitions. [2021-11-05 12:44:28,947 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:44:28,948 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 162 transitions. [2021-11-05 12:44:28,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-05 12:44:28,948 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:44:28,949 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 12:44:28,949 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-05 12:44:28,949 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-05 12:44:28,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:44:28,950 INFO L85 PathProgramCache]: Analyzing trace with hash -235054390, now seen corresponding path program 1 times [2021-11-05 12:44:28,950 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:44:28,950 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977734788] [2021-11-05 12:44:28,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:44:28,950 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:44:29,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:44:29,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 12:44:29,656 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:44:29,656 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977734788] [2021-11-05 12:44:29,656 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977734788] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:44:29,656 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:44:29,656 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-05 12:44:29,657 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088319881] [2021-11-05 12:44:29,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:44:29,657 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-05 12:44:29,657 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:44:29,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-05 12:44:29,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-11-05 12:44:29,658 INFO L87 Difference]: Start difference. First operand 133 states and 162 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:44:31,710 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:44:33,858 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:44:35,987 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:44:38,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:44:38,068 INFO L93 Difference]: Finished difference Result 399 states and 482 transitions. [2021-11-05 12:44:38,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-05 12:44:38,068 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-11-05 12:44:38,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:44:38,070 INFO L225 Difference]: With dead ends: 399 [2021-11-05 12:44:38,071 INFO L226 Difference]: Without dead ends: 292 [2021-11-05 12:44:38,071 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 892.54ms TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2021-11-05 12:44:38,072 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 532 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 40 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7174.43ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 13.03ms SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7661.18ms IncrementalHoareTripleChecker+Time [2021-11-05 12:44:38,072 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [532 Valid, 701 Invalid, 434 Unknown, 0 Unchecked, 13.03ms Time], IncrementalHoareTripleChecker [40 Valid, 391 Invalid, 3 Unknown, 0 Unchecked, 7661.18ms Time] [2021-11-05 12:44:38,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2021-11-05 12:44:38,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 207. [2021-11-05 12:44:38,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 202 states have (on average 1.2425742574257426) internal successors, (251), 206 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:44:38,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 251 transitions. [2021-11-05 12:44:38,095 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 251 transitions. Word has length 42 [2021-11-05 12:44:38,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:44:38,099 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 251 transitions. [2021-11-05 12:44:38,099 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:44:38,099 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 251 transitions. [2021-11-05 12:44:38,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-05 12:44:38,101 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:44:38,101 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 12:44:38,102 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-05 12:44:38,102 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-05 12:44:38,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:44:38,103 INFO L85 PathProgramCache]: Analyzing trace with hash 324843685, now seen corresponding path program 1 times [2021-11-05 12:44:38,103 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:44:38,103 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142327885] [2021-11-05 12:44:38,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:44:38,103 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:44:38,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:44:38,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 12:44:38,369 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:44:38,369 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142327885] [2021-11-05 12:44:38,369 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142327885] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:44:38,369 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:44:38,369 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-05 12:44:38,369 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420700292] [2021-11-05 12:44:38,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:44:38,370 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 12:44:38,370 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:44:38,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 12:44:38,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 12:44:38,371 INFO L87 Difference]: Start difference. First operand 207 states and 251 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:44:38,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:44:38,473 INFO L93 Difference]: Finished difference Result 264 states and 317 transitions. [2021-11-05 12:44:38,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-05 12:44:38,474 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2021-11-05 12:44:38,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:44:38,475 INFO L225 Difference]: With dead ends: 264 [2021-11-05 12:44:38,475 INFO L226 Difference]: Without dead ends: 207 [2021-11-05 12:44:38,475 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 57.41ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 12:44:38,476 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 102 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 72.23ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.84ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 78.18ms IncrementalHoareTripleChecker+Time [2021-11-05 12:44:38,476 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 286 Invalid, 35 Unknown, 0 Unchecked, 0.84ms Time], IncrementalHoareTripleChecker [5 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 78.18ms Time] [2021-11-05 12:44:38,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2021-11-05 12:44:38,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2021-11-05 12:44:38,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 202 states have (on average 1.2326732673267327) internal successors, (249), 206 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:44:38,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 249 transitions. [2021-11-05 12:44:38,484 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 249 transitions. Word has length 43 [2021-11-05 12:44:38,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:44:38,484 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 249 transitions. [2021-11-05 12:44:38,484 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:44:38,484 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 249 transitions. [2021-11-05 12:44:38,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-05 12:44:38,485 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:44:38,486 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-05 12:44:38,486 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-05 12:44:38,486 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-05 12:44:38,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:44:38,486 INFO L85 PathProgramCache]: Analyzing trace with hash 495838041, now seen corresponding path program 1 times [2021-11-05 12:44:38,486 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:44:38,487 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259259653] [2021-11-05 12:44:38,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:44:38,487 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:44:38,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:44:38,613 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 12:44:38,614 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:44:38,614 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259259653] [2021-11-05 12:44:38,614 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259259653] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:44:38,614 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:44:38,614 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-05 12:44:38,614 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367574713] [2021-11-05 12:44:38,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:44:38,615 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-05 12:44:38,615 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:44:38,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-05 12:44:38,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 12:44:38,616 INFO L87 Difference]: Start difference. First operand 207 states and 249 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:44:38,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:44:38,644 INFO L93 Difference]: Finished difference Result 298 states and 361 transitions. [2021-11-05 12:44:38,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-05 12:44:38,660 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-11-05 12:44:38,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:44:38,661 INFO L225 Difference]: With dead ends: 298 [2021-11-05 12:44:38,661 INFO L226 Difference]: Without dead ends: 210 [2021-11-05 12:44:38,661 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.84ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-05 12:44:38,662 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.03ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.38ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.31ms IncrementalHoareTripleChecker+Time [2021-11-05 12:44:38,662 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 282 Invalid, 7 Unknown, 0 Unchecked, 0.38ms Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 21.31ms Time] [2021-11-05 12:44:38,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2021-11-05 12:44:38,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2021-11-05 12:44:38,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 205 states have (on average 1.2292682926829268) internal successors, (252), 209 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:44:38,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 252 transitions. [2021-11-05 12:44:38,669 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 252 transitions. Word has length 45 [2021-11-05 12:44:38,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:44:38,670 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 252 transitions. [2021-11-05 12:44:38,670 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:44:38,670 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 252 transitions. [2021-11-05 12:44:38,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-05 12:44:38,671 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:44:38,671 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 12:44:38,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-05 12:44:38,671 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-05 12:44:38,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:44:38,672 INFO L85 PathProgramCache]: Analyzing trace with hash 2004884674, now seen corresponding path program 1 times [2021-11-05 12:44:38,672 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:44:38,672 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149908944] [2021-11-05 12:44:38,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:44:38,672 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:44:38,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:44:39,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 12:44:39,095 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:44:39,095 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149908944] [2021-11-05 12:44:39,095 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149908944] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:44:39,095 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:44:39,095 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-05 12:44:39,096 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225943920] [2021-11-05 12:44:39,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:44:39,096 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-05 12:44:39,096 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:44:39,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-05 12:44:39,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-05 12:44:39,096 INFO L87 Difference]: Start difference. First operand 210 states and 252 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:44:39,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:44:39,926 INFO L93 Difference]: Finished difference Result 433 states and 511 transitions. [2021-11-05 12:44:39,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-05 12:44:39,927 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-11-05 12:44:39,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:44:39,928 INFO L225 Difference]: With dead ends: 433 [2021-11-05 12:44:39,928 INFO L226 Difference]: Without dead ends: 262 [2021-11-05 12:44:39,929 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 207.20ms TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-05 12:44:39,929 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 84 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 654.18ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.87ms SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 708.39ms IncrementalHoareTripleChecker+Time [2021-11-05 12:44:39,929 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 678 Invalid, 275 Unknown, 0 Unchecked, 4.87ms Time], IncrementalHoareTripleChecker [35 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 708.39ms Time] [2021-11-05 12:44:39,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2021-11-05 12:44:39,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 210. [2021-11-05 12:44:39,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 205 states have (on average 1.2195121951219512) internal successors, (250), 209 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:44:39,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 250 transitions. [2021-11-05 12:44:39,941 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 250 transitions. Word has length 46 [2021-11-05 12:44:39,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:44:39,941 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 250 transitions. [2021-11-05 12:44:39,941 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:44:39,941 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 250 transitions. [2021-11-05 12:44:39,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-11-05 12:44:39,942 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:44:39,942 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-05 12:44:39,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-05 12:44:39,943 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-05 12:44:39,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:44:39,943 INFO L85 PathProgramCache]: Analyzing trace with hash -954265451, now seen corresponding path program 1 times [2021-11-05 12:44:39,943 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:44:39,943 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723525889] [2021-11-05 12:44:39,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:44:39,944 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:44:40,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:44:40,494 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-05 12:44:40,494 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:44:40,494 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723525889] [2021-11-05 12:44:40,494 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723525889] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:44:40,494 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:44:40,494 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-05 12:44:40,494 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715292420] [2021-11-05 12:44:40,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:44:40,495 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-05 12:44:40,495 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:44:40,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-05 12:44:40,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-05 12:44:40,495 INFO L87 Difference]: Start difference. First operand 210 states and 250 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:44:42,539 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:44:44,697 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:44:45,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:44:45,742 INFO L93 Difference]: Finished difference Result 408 states and 486 transitions. [2021-11-05 12:44:45,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-05 12:44:45,743 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2021-11-05 12:44:45,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:44:45,744 INFO L225 Difference]: With dead ends: 408 [2021-11-05 12:44:45,744 INFO L226 Difference]: Without dead ends: 272 [2021-11-05 12:44:45,745 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 361.00ms TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-11-05 12:44:45,745 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 382 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 23 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4644.38ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.62ms SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4979.17ms IncrementalHoareTripleChecker+Time [2021-11-05 12:44:45,745 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [382 Valid, 467 Invalid, 223 Unknown, 0 Unchecked, 5.62ms Time], IncrementalHoareTripleChecker [23 Valid, 198 Invalid, 2 Unknown, 0 Unchecked, 4979.17ms Time] [2021-11-05 12:44:45,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2021-11-05 12:44:45,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 204. [2021-11-05 12:44:45,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 199 states have (on average 1.2060301507537687) internal successors, (240), 203 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:44:45,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 240 transitions. [2021-11-05 12:44:45,756 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 240 transitions. Word has length 47 [2021-11-05 12:44:45,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:44:45,756 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 240 transitions. [2021-11-05 12:44:45,756 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:44:45,756 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 240 transitions. [2021-11-05 12:44:45,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-05 12:44:45,757 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:44:45,758 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 12:44:45,758 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-05 12:44:45,758 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-05 12:44:45,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:44:45,759 INFO L85 PathProgramCache]: Analyzing trace with hash 93394749, now seen corresponding path program 1 times [2021-11-05 12:44:45,759 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:44:45,759 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699844565] [2021-11-05 12:44:45,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:44:45,759 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:44:45,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:44:46,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 12:44:46,177 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:44:46,177 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699844565] [2021-11-05 12:44:46,177 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699844565] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:44:46,177 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:44:46,177 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-05 12:44:46,177 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736534158] [2021-11-05 12:44:46,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:44:46,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-05 12:44:46,177 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:44:46,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-05 12:44:46,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-05 12:44:46,178 INFO L87 Difference]: Start difference. First operand 204 states and 240 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:44:48,222 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:44:48,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:44:48,915 INFO L93 Difference]: Finished difference Result 394 states and 463 transitions. [2021-11-05 12:44:48,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-05 12:44:48,915 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-11-05 12:44:48,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:44:48,917 INFO L225 Difference]: With dead ends: 394 [2021-11-05 12:44:48,917 INFO L226 Difference]: Without dead ends: 230 [2021-11-05 12:44:48,917 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 89.21ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-05 12:44:48,917 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 190 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 32 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2525.20ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.35ms SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2686.64ms IncrementalHoareTripleChecker+Time [2021-11-05 12:44:48,918 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [190 Valid, 279 Invalid, 197 Unknown, 0 Unchecked, 3.35ms Time], IncrementalHoareTripleChecker [32 Valid, 164 Invalid, 1 Unknown, 0 Unchecked, 2686.64ms Time] [2021-11-05 12:44:48,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2021-11-05 12:44:48,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 204. [2021-11-05 12:44:48,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 199 states have (on average 1.1658291457286432) internal successors, (232), 203 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:44:48,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 232 transitions. [2021-11-05 12:44:48,924 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 232 transitions. Word has length 48 [2021-11-05 12:44:48,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:44:48,925 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 232 transitions. [2021-11-05 12:44:48,925 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:44:48,925 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 232 transitions. [2021-11-05 12:44:48,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-05 12:44:48,925 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:44:48,925 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 12:44:48,925 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-05 12:44:48,926 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-05 12:44:48,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:44:48,926 INFO L85 PathProgramCache]: Analyzing trace with hash 2144378747, now seen corresponding path program 1 times [2021-11-05 12:44:48,926 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:44:48,926 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658612321] [2021-11-05 12:44:48,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:44:48,926 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:44:49,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:44:49,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 12:44:49,471 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:44:49,471 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658612321] [2021-11-05 12:44:49,471 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658612321] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:44:49,471 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:44:49,471 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-05 12:44:49,471 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536386836] [2021-11-05 12:44:49,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:44:49,472 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-05 12:44:49,472 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:44:49,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-05 12:44:49,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-05 12:44:49,472 INFO L87 Difference]: Start difference. First operand 204 states and 232 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:44:51,514 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:44:53,621 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:44:55,772 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:44:57,917 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:44:59,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:44:59,585 INFO L93 Difference]: Finished difference Result 536 states and 610 transitions. [2021-11-05 12:44:59,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-05 12:44:59,585 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-11-05 12:44:59,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:44:59,587 INFO L225 Difference]: With dead ends: 536 [2021-11-05 12:44:59,587 INFO L226 Difference]: Without dead ends: 472 [2021-11-05 12:44:59,587 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 586.80ms TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2021-11-05 12:44:59,588 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 886 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 46 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8968.46ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 886 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.44ms SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9600.90ms IncrementalHoareTripleChecker+Time [2021-11-05 12:44:59,588 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [886 Valid, 436 Invalid, 360 Unknown, 0 Unchecked, 7.44ms Time], IncrementalHoareTripleChecker [46 Valid, 310 Invalid, 4 Unknown, 0 Unchecked, 9600.90ms Time] [2021-11-05 12:44:59,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2021-11-05 12:44:59,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 181. [2021-11-05 12:44:59,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 176 states have (on average 1.1647727272727273) internal successors, (205), 180 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:44:59,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 205 transitions. [2021-11-05 12:44:59,594 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 205 transitions. Word has length 48 [2021-11-05 12:44:59,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:44:59,594 INFO L470 AbstractCegarLoop]: Abstraction has 181 states and 205 transitions. [2021-11-05 12:44:59,594 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:44:59,595 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 205 transitions. [2021-11-05 12:44:59,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-11-05 12:44:59,595 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:44:59,595 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 12:44:59,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-05 12:44:59,595 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-05 12:44:59,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:44:59,596 INFO L85 PathProgramCache]: Analyzing trace with hash 870337434, now seen corresponding path program 1 times [2021-11-05 12:44:59,596 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:44:59,596 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204397351] [2021-11-05 12:44:59,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:44:59,596 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:44:59,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:44:59,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 12:44:59,894 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:44:59,894 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204397351] [2021-11-05 12:44:59,894 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204397351] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:44:59,894 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:44:59,894 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-05 12:44:59,894 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211589174] [2021-11-05 12:44:59,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:44:59,894 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 12:44:59,894 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:44:59,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 12:44:59,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 12:44:59,895 INFO L87 Difference]: Start difference. First operand 181 states and 205 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:45:01,937 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:45:02,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:45:02,567 INFO L93 Difference]: Finished difference Result 338 states and 383 transitions. [2021-11-05 12:45:02,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-05 12:45:02,568 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2021-11-05 12:45:02,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:45:02,568 INFO L225 Difference]: With dead ends: 338 [2021-11-05 12:45:02,568 INFO L226 Difference]: Without dead ends: 181 [2021-11-05 12:45:02,569 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 80.06ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 12:45:02,569 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 46 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 21 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2434.75ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.12ms SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2611.40ms IncrementalHoareTripleChecker+Time [2021-11-05 12:45:02,569 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 214 Invalid, 145 Unknown, 0 Unchecked, 2.12ms Time], IncrementalHoareTripleChecker [21 Valid, 123 Invalid, 1 Unknown, 0 Unchecked, 2611.40ms Time] [2021-11-05 12:45:02,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2021-11-05 12:45:02,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2021-11-05 12:45:02,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 176 states have (on average 1.125) internal successors, (198), 180 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:45:02,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 198 transitions. [2021-11-05 12:45:02,575 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 198 transitions. Word has length 49 [2021-11-05 12:45:02,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:45:02,576 INFO L470 AbstractCegarLoop]: Abstraction has 181 states and 198 transitions. [2021-11-05 12:45:02,576 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:45:02,576 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 198 transitions. [2021-11-05 12:45:02,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-11-05 12:45:02,576 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:45:02,577 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 12:45:02,577 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-05 12:45:02,577 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-05 12:45:02,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:45:02,578 INFO L85 PathProgramCache]: Analyzing trace with hash 190279064, now seen corresponding path program 1 times [2021-11-05 12:45:02,578 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:45:02,578 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840337558] [2021-11-05 12:45:02,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:45:02,578 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:45:02,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:45:03,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 12:45:03,219 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:45:03,219 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840337558] [2021-11-05 12:45:03,219 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840337558] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:45:03,219 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:45:03,219 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-05 12:45:03,219 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392369498] [2021-11-05 12:45:03,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:45:03,220 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-05 12:45:03,220 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:45:03,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-05 12:45:03,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-11-05 12:45:03,220 INFO L87 Difference]: Start difference. First operand 181 states and 198 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:45:05,266 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:45:07,382 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:45:09,540 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:45:11,660 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:45:13,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:45:13,907 INFO L93 Difference]: Finished difference Result 310 states and 334 transitions. [2021-11-05 12:45:13,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-05 12:45:13,908 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2021-11-05 12:45:13,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:45:13,909 INFO L225 Difference]: With dead ends: 310 [2021-11-05 12:45:13,909 INFO L226 Difference]: Without dead ends: 265 [2021-11-05 12:45:13,909 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1053.40ms TimeCoverageRelationStatistics Valid=149, Invalid=357, Unknown=0, NotChecked=0, Total=506 [2021-11-05 12:45:13,910 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 441 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 50 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9239.68ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.67ms SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9833.47ms IncrementalHoareTripleChecker+Time [2021-11-05 12:45:13,910 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [441 Valid, 602 Invalid, 456 Unknown, 0 Unchecked, 6.67ms Time], IncrementalHoareTripleChecker [50 Valid, 402 Invalid, 4 Unknown, 0 Unchecked, 9833.47ms Time] [2021-11-05 12:45:13,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2021-11-05 12:45:13,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 201. [2021-11-05 12:45:13,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 196 states have (on average 1.1122448979591837) internal successors, (218), 200 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:45:13,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 218 transitions. [2021-11-05 12:45:13,917 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 218 transitions. Word has length 49 [2021-11-05 12:45:13,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:45:13,917 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 218 transitions. [2021-11-05 12:45:13,917 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:45:13,917 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 218 transitions. [2021-11-05 12:45:13,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-05 12:45:13,918 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:45:13,918 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 12:45:13,918 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-05 12:45:13,918 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-05 12:45:13,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:45:13,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1409745750, now seen corresponding path program 1 times [2021-11-05 12:45:13,918 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:45:13,918 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627313261] [2021-11-05 12:45:13,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:45:13,918 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:45:14,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:45:14,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 12:45:14,350 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:45:14,350 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627313261] [2021-11-05 12:45:14,351 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627313261] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:45:14,351 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:45:14,351 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-05 12:45:14,351 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79478639] [2021-11-05 12:45:14,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:45:14,351 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-05 12:45:14,351 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:45:14,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-05 12:45:14,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-05 12:45:14,352 INFO L87 Difference]: Start difference. First operand 201 states and 218 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:45:16,394 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:45:18,584 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:45:20,723 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:45:22,864 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:45:24,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:45:24,409 INFO L93 Difference]: Finished difference Result 566 states and 618 transitions. [2021-11-05 12:45:24,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-05 12:45:24,410 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-11-05 12:45:24,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:45:24,411 INFO L225 Difference]: With dead ends: 566 [2021-11-05 12:45:24,411 INFO L226 Difference]: Without dead ends: 482 [2021-11-05 12:45:24,412 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 499.89ms TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2021-11-05 12:45:24,412 INFO L933 BasicCegarLoop]: 142 mSDtfsCounter, 774 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 21 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9002.79ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.41ms SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9642.52ms IncrementalHoareTripleChecker+Time [2021-11-05 12:45:24,412 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [774 Valid, 665 Invalid, 357 Unknown, 0 Unchecked, 5.41ms Time], IncrementalHoareTripleChecker [21 Valid, 332 Invalid, 4 Unknown, 0 Unchecked, 9642.52ms Time] [2021-11-05 12:45:24,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2021-11-05 12:45:24,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 203. [2021-11-05 12:45:24,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 198 states have (on average 1.1111111111111112) internal successors, (220), 202 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:45:24,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 220 transitions. [2021-11-05 12:45:24,419 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 220 transitions. Word has length 54 [2021-11-05 12:45:24,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:45:24,422 INFO L470 AbstractCegarLoop]: Abstraction has 203 states and 220 transitions. [2021-11-05 12:45:24,422 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:45:24,422 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 220 transitions. [2021-11-05 12:45:24,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-11-05 12:45:24,423 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:45:24,423 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 12:45:24,423 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-05 12:45:24,423 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-05 12:45:24,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:45:24,423 INFO L85 PathProgramCache]: Analyzing trace with hash 2092937159, now seen corresponding path program 1 times [2021-11-05 12:45:24,424 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:45:24,424 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285140381] [2021-11-05 12:45:24,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:45:24,424 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:45:24,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:45:25,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 12:45:25,122 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:45:25,122 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285140381] [2021-11-05 12:45:25,122 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285140381] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:45:25,122 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:45:25,122 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-05 12:45:25,122 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814655909] [2021-11-05 12:45:25,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:45:25,122 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-05 12:45:25,122 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:45:25,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-05 12:45:25,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-11-05 12:45:25,123 INFO L87 Difference]: Start difference. First operand 203 states and 220 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:45:27,165 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:45:29,410 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:45:31,529 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:45:33,634 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:45:35,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:45:35,835 INFO L93 Difference]: Finished difference Result 502 states and 544 transitions. [2021-11-05 12:45:35,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-05 12:45:35,836 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2021-11-05 12:45:35,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:45:35,837 INFO L225 Difference]: With dead ends: 502 [2021-11-05 12:45:35,837 INFO L226 Difference]: Without dead ends: 457 [2021-11-05 12:45:35,838 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 947.73ms TimeCoverageRelationStatistics Valid=178, Invalid=422, Unknown=0, NotChecked=0, Total=600 [2021-11-05 12:45:35,838 INFO L933 BasicCegarLoop]: 88 mSDtfsCounter, 585 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 50 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9264.71ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 585 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.69ms SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9963.80ms IncrementalHoareTripleChecker+Time [2021-11-05 12:45:35,838 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [585 Valid, 562 Invalid, 453 Unknown, 0 Unchecked, 6.69ms Time], IncrementalHoareTripleChecker [50 Valid, 399 Invalid, 4 Unknown, 0 Unchecked, 9963.80ms Time] [2021-11-05 12:45:35,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2021-11-05 12:45:35,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 173. [2021-11-05 12:45:35,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 168 states have (on average 1.1130952380952381) internal successors, (187), 172 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:45:35,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 187 transitions. [2021-11-05 12:45:35,844 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 187 transitions. Word has length 55 [2021-11-05 12:45:35,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:45:35,844 INFO L470 AbstractCegarLoop]: Abstraction has 173 states and 187 transitions. [2021-11-05 12:45:35,844 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:45:35,844 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 187 transitions. [2021-11-05 12:45:35,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-11-05 12:45:35,845 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:45:35,845 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 12:45:35,845 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-05 12:45:35,845 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-05 12:45:35,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:45:35,845 INFO L85 PathProgramCache]: Analyzing trace with hash 485245166, now seen corresponding path program 1 times [2021-11-05 12:45:35,845 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:45:35,845 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906234522] [2021-11-05 12:45:35,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:45:35,846 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:45:37,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:45:38,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 12:45:38,191 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:45:38,191 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906234522] [2021-11-05 12:45:38,191 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906234522] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:45:38,191 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:45:38,191 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-05 12:45:38,191 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464828545] [2021-11-05 12:45:38,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:45:38,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-05 12:45:38,191 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:45:38,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-05 12:45:38,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-11-05 12:45:38,192 INFO L87 Difference]: Start difference. First operand 173 states and 187 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:45:40,236 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:45:41,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:45:41,440 INFO L93 Difference]: Finished difference Result 393 states and 422 transitions. [2021-11-05 12:45:41,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-05 12:45:41,441 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2021-11-05 12:45:41,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:45:41,441 INFO L225 Difference]: With dead ends: 393 [2021-11-05 12:45:41,441 INFO L226 Difference]: Without dead ends: 243 [2021-11-05 12:45:41,442 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 485.11ms TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2021-11-05 12:45:41,442 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 293 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2682.21ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.93ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2991.52ms IncrementalHoareTripleChecker+Time [2021-11-05 12:45:41,442 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [293 Valid, 536 Invalid, 253 Unknown, 0 Unchecked, 2.93ms Time], IncrementalHoareTripleChecker [5 Valid, 247 Invalid, 1 Unknown, 0 Unchecked, 2991.52ms Time] [2021-11-05 12:45:41,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2021-11-05 12:45:41,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 177. [2021-11-05 12:45:41,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 172 states have (on average 1.1104651162790697) internal successors, (191), 176 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:45:41,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 191 transitions. [2021-11-05 12:45:41,449 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 191 transitions. Word has length 56 [2021-11-05 12:45:41,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:45:41,449 INFO L470 AbstractCegarLoop]: Abstraction has 177 states and 191 transitions. [2021-11-05 12:45:41,450 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:45:41,450 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 191 transitions. [2021-11-05 12:45:41,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-11-05 12:45:41,453 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:45:41,453 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 12:45:41,454 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-05 12:45:41,454 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-05 12:45:41,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:45:41,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1309942923, now seen corresponding path program 1 times [2021-11-05 12:45:41,454 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:45:41,454 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124344680] [2021-11-05 12:45:41,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:45:41,455 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:45:41,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:45:41,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 12:45:41,631 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:45:41,631 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124344680] [2021-11-05 12:45:41,631 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124344680] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:45:41,631 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:45:41,632 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-05 12:45:41,632 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635621889] [2021-11-05 12:45:41,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:45:41,632 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-05 12:45:41,632 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:45:41,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-05 12:45:41,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-05 12:45:41,633 INFO L87 Difference]: Start difference. First operand 177 states and 191 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:45:41,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:45:41,733 INFO L93 Difference]: Finished difference Result 188 states and 201 transitions. [2021-11-05 12:45:41,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-05 12:45:41,734 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-11-05 12:45:41,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:45:41,734 INFO L225 Difference]: With dead ends: 188 [2021-11-05 12:45:41,734 INFO L226 Difference]: Without dead ends: 177 [2021-11-05 12:45:41,735 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 48.05ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-05 12:45:41,735 INFO L933 BasicCegarLoop]: 127 mSDtfsCounter, 116 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 64.63ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.53ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 69.83ms IncrementalHoareTripleChecker+Time [2021-11-05 12:45:41,735 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 212 Invalid, 26 Unknown, 0 Unchecked, 0.53ms Time], IncrementalHoareTripleChecker [5 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 69.83ms Time] [2021-11-05 12:45:41,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2021-11-05 12:45:41,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2021-11-05 12:45:41,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 172 states have (on average 1.1046511627906976) internal successors, (190), 176 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:45:41,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 190 transitions. [2021-11-05 12:45:41,740 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 190 transitions. Word has length 58 [2021-11-05 12:45:41,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:45:41,741 INFO L470 AbstractCegarLoop]: Abstraction has 177 states and 190 transitions. [2021-11-05 12:45:41,741 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:45:41,741 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 190 transitions. [2021-11-05 12:45:41,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-11-05 12:45:41,741 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:45:41,741 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 12:45:41,741 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-05 12:45:41,741 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-05 12:45:41,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:45:41,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1050364765, now seen corresponding path program 1 times [2021-11-05 12:45:41,742 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:45:41,742 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491530311] [2021-11-05 12:45:41,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:45:41,742 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:45:44,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:45:45,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 12:45:45,093 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:45:45,093 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491530311] [2021-11-05 12:45:45,093 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491530311] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:45:45,093 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:45:45,094 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-05 12:45:45,094 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049118028] [2021-11-05 12:45:45,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:45:45,094 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-05 12:45:45,094 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:45:45,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-05 12:45:45,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-11-05 12:45:45,094 INFO L87 Difference]: Start difference. First operand 177 states and 190 transitions. Second operand has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:45:47,138 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:45:49,260 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:45:51,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:45:51,822 INFO L93 Difference]: Finished difference Result 435 states and 460 transitions. [2021-11-05 12:45:51,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-05 12:45:51,823 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-11-05 12:45:51,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:45:51,824 INFO L225 Difference]: With dead ends: 435 [2021-11-05 12:45:51,824 INFO L226 Difference]: Without dead ends: 300 [2021-11-05 12:45:51,824 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1285.21ms TimeCoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2021-11-05 12:45:51,824 INFO L933 BasicCegarLoop]: 209 mSDtfsCounter, 590 mSDsluCounter, 1036 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 11 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5468.01ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 1245 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.56ms SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5934.47ms IncrementalHoareTripleChecker+Time [2021-11-05 12:45:51,825 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [590 Valid, 1245 Invalid, 565 Unknown, 0 Unchecked, 7.56ms Time], IncrementalHoareTripleChecker [11 Valid, 552 Invalid, 2 Unknown, 0 Unchecked, 5934.47ms Time] [2021-11-05 12:45:51,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2021-11-05 12:45:51,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 177. [2021-11-05 12:45:51,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 172 states have (on average 1.0988372093023255) internal successors, (189), 176 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:45:51,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 189 transitions. [2021-11-05 12:45:51,831 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 189 transitions. Word has length 59 [2021-11-05 12:45:51,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:45:51,833 INFO L470 AbstractCegarLoop]: Abstraction has 177 states and 189 transitions. [2021-11-05 12:45:51,833 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:45:51,833 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 189 transitions. [2021-11-05 12:45:51,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-05 12:45:51,834 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:45:51,834 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 12:45:51,834 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-05 12:45:51,834 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-05 12:45:51,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:45:51,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1944530334, now seen corresponding path program 1 times [2021-11-05 12:45:51,835 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:45:51,835 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122291486] [2021-11-05 12:45:51,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:45:51,835 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:45:55,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:45:56,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 12:45:56,253 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:45:56,253 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122291486] [2021-11-05 12:45:56,253 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122291486] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:45:56,253 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:45:56,253 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-05 12:45:56,253 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024554625] [2021-11-05 12:45:56,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:45:56,253 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-05 12:45:56,253 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:45:56,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-05 12:45:56,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2021-11-05 12:45:56,254 INFO L87 Difference]: Start difference. First operand 177 states and 189 transitions. Second operand has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:45:58,308 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:46:00,430 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:46:02,605 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:46:04,742 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:46:06,883 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:46:10,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:46:10,166 INFO L93 Difference]: Finished difference Result 371 states and 396 transitions. [2021-11-05 12:46:10,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-05 12:46:10,170 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-11-05 12:46:10,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:46:10,171 INFO L225 Difference]: With dead ends: 371 [2021-11-05 12:46:10,171 INFO L226 Difference]: Without dead ends: 300 [2021-11-05 12:46:10,171 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 2188.49ms TimeCoverageRelationStatistics Valid=260, Invalid=796, Unknown=0, NotChecked=0, Total=1056 [2021-11-05 12:46:10,172 INFO L933 BasicCegarLoop]: 151 mSDtfsCounter, 637 mSDsluCounter, 1004 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 63 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11518.88ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 637 SdHoareTripleChecker+Valid, 1155 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.12ms SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12266.97ms IncrementalHoareTripleChecker+Time [2021-11-05 12:46:10,172 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [637 Valid, 1155 Invalid, 601 Unknown, 0 Unchecked, 7.12ms Time], IncrementalHoareTripleChecker [63 Valid, 533 Invalid, 5 Unknown, 0 Unchecked, 12266.97ms Time] [2021-11-05 12:46:10,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2021-11-05 12:46:10,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 221. [2021-11-05 12:46:10,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 216 states have (on average 1.1111111111111112) internal successors, (240), 220 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:46:10,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 240 transitions. [2021-11-05 12:46:10,182 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 240 transitions. Word has length 62 [2021-11-05 12:46:10,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:46:10,182 INFO L470 AbstractCegarLoop]: Abstraction has 221 states and 240 transitions. [2021-11-05 12:46:10,183 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.133333333333334) internal successors, (62), 15 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:46:10,183 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 240 transitions. [2021-11-05 12:46:10,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-05 12:46:10,183 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:46:10,183 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 12:46:10,184 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-05 12:46:10,184 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-05 12:46:10,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:46:10,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1831062709, now seen corresponding path program 1 times [2021-11-05 12:46:10,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:46:10,184 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651605328] [2021-11-05 12:46:10,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:46:10,185 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:46:10,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:46:10,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 12:46:10,772 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:46:10,772 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651605328] [2021-11-05 12:46:10,772 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651605328] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:46:10,772 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:46:10,772 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-05 12:46:10,772 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171655275] [2021-11-05 12:46:10,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:46:10,773 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-05 12:46:10,773 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:46:10,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-05 12:46:10,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-05 12:46:10,773 INFO L87 Difference]: Start difference. First operand 221 states and 240 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:46:12,815 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:46:14,951 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:46:17,098 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:46:18,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:46:18,452 INFO L93 Difference]: Finished difference Result 278 states and 298 transitions. [2021-11-05 12:46:18,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-05 12:46:18,453 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-11-05 12:46:18,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:46:18,454 INFO L225 Difference]: With dead ends: 278 [2021-11-05 12:46:18,454 INFO L226 Difference]: Without dead ends: 268 [2021-11-05 12:46:18,454 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 804.49ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-11-05 12:46:18,454 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 66 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 3 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6523.76ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.22ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7031.17ms IncrementalHoareTripleChecker+Time [2021-11-05 12:46:18,455 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 471 Invalid, 178 Unknown, 0 Unchecked, 2.22ms Time], IncrementalHoareTripleChecker [3 Valid, 172 Invalid, 3 Unknown, 0 Unchecked, 7031.17ms Time] [2021-11-05 12:46:18,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2021-11-05 12:46:18,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 266. [2021-11-05 12:46:18,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 261 states have (on average 1.0957854406130267) internal successors, (286), 265 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:46:18,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 286 transitions. [2021-11-05 12:46:18,464 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 286 transitions. Word has length 64 [2021-11-05 12:46:18,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:46:18,465 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 286 transitions. [2021-11-05 12:46:18,465 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:46:18,465 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 286 transitions. [2021-11-05 12:46:18,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-05 12:46:18,465 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:46:18,466 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 12:46:18,466 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-05 12:46:18,466 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-05 12:46:18,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:46:18,466 INFO L85 PathProgramCache]: Analyzing trace with hash 2002093992, now seen corresponding path program 1 times [2021-11-05 12:46:18,466 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:46:18,467 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118716660] [2021-11-05 12:46:18,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:46:18,467 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:46:18,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:46:19,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 12:46:19,315 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:46:19,315 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118716660] [2021-11-05 12:46:19,315 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118716660] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:46:19,315 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:46:19,315 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-05 12:46:19,315 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354789589] [2021-11-05 12:46:19,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:46:19,315 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-05 12:46:19,315 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:46:19,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-05 12:46:19,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-11-05 12:46:19,316 INFO L87 Difference]: Start difference. First operand 266 states and 286 transitions. Second operand has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:46:21,376 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:46:23,520 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:46:25,642 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:46:27,796 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:46:30,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:46:30,654 INFO L93 Difference]: Finished difference Result 293 states and 313 transitions. [2021-11-05 12:46:30,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-05 12:46:30,654 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-11-05 12:46:30,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:46:30,655 INFO L225 Difference]: With dead ends: 293 [2021-11-05 12:46:30,655 INFO L226 Difference]: Without dead ends: 233 [2021-11-05 12:46:30,656 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1860.17ms TimeCoverageRelationStatistics Valid=216, Invalid=596, Unknown=0, NotChecked=0, Total=812 [2021-11-05 12:46:30,656 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 381 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 60 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9205.62ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.53ms SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9854.49ms IncrementalHoareTripleChecker+Time [2021-11-05 12:46:30,656 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [381 Valid, 693 Invalid, 536 Unknown, 0 Unchecked, 4.53ms Time], IncrementalHoareTripleChecker [60 Valid, 472 Invalid, 4 Unknown, 0 Unchecked, 9854.49ms Time] [2021-11-05 12:46:30,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2021-11-05 12:46:30,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 208. [2021-11-05 12:46:30,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 203 states have (on average 1.1083743842364533) internal successors, (225), 207 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:46:30,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 225 transitions. [2021-11-05 12:46:30,665 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 225 transitions. Word has length 64 [2021-11-05 12:46:30,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:46:30,665 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 225 transitions. [2021-11-05 12:46:30,665 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:46:30,665 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 225 transitions. [2021-11-05 12:46:30,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-05 12:46:30,666 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:46:30,666 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 12:46:30,666 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-05 12:46:30,666 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-05 12:46:30,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:46:30,667 INFO L85 PathProgramCache]: Analyzing trace with hash 690621047, now seen corresponding path program 1 times [2021-11-05 12:46:30,667 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:46:30,667 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971317514] [2021-11-05 12:46:30,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:46:30,667 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:46:30,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:46:31,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 12:46:31,212 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:46:31,212 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971317514] [2021-11-05 12:46:31,212 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971317514] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:46:31,212 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:46:31,212 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-05 12:46:31,212 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267008704] [2021-11-05 12:46:31,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:46:31,212 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-05 12:46:31,212 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:46:31,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-05 12:46:31,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-11-05 12:46:31,213 INFO L87 Difference]: Start difference. First operand 208 states and 225 transitions. Second operand has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:46:33,258 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:46:35,404 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:46:38,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:46:38,543 INFO L93 Difference]: Finished difference Result 325 states and 348 transitions. [2021-11-05 12:46:38,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-05 12:46:38,543 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-11-05 12:46:38,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:46:38,544 INFO L225 Difference]: With dead ends: 325 [2021-11-05 12:46:38,544 INFO L226 Difference]: Without dead ends: 317 [2021-11-05 12:46:38,545 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 1331.37ms TimeCoverageRelationStatistics Valid=195, Invalid=617, Unknown=0, NotChecked=0, Total=812 [2021-11-05 12:46:38,545 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 377 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 240 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5768.59ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.03ms SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6197.17ms IncrementalHoareTripleChecker+Time [2021-11-05 12:46:38,545 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [377 Valid, 531 Invalid, 892 Unknown, 0 Unchecked, 8.03ms Time], IncrementalHoareTripleChecker [240 Valid, 650 Invalid, 2 Unknown, 0 Unchecked, 6197.17ms Time] [2021-11-05 12:46:38,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2021-11-05 12:46:38,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 209. [2021-11-05 12:46:38,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 204 states have (on average 1.1029411764705883) internal successors, (225), 208 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:46:38,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 225 transitions. [2021-11-05 12:46:38,570 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 225 transitions. Word has length 64 [2021-11-05 12:46:38,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:46:38,570 INFO L470 AbstractCegarLoop]: Abstraction has 209 states and 225 transitions. [2021-11-05 12:46:38,570 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:46:38,570 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 225 transitions. [2021-11-05 12:46:38,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-05 12:46:38,571 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:46:38,571 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 12:46:38,571 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-05 12:46:38,571 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-05 12:46:38,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:46:38,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1188769797, now seen corresponding path program 1 times [2021-11-05 12:46:38,572 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:46:38,572 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999488270] [2021-11-05 12:46:38,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:46:38,572 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:46:41,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:46:42,615 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 12:46:42,615 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:46:42,615 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999488270] [2021-11-05 12:46:42,615 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999488270] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-05 12:46:42,615 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603611280] [2021-11-05 12:46:42,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:46:42,616 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 12:46:42,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 12:46:42,617 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-05 12:46:42,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-05 12:46:43,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:46:43,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 2942 conjuncts, 71 conjunts are in the unsatisfiable core [2021-11-05 12:46:43,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 12:46:43,413 INFO L388 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 [2021-11-05 12:46:43,673 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-05 12:46:43,674 INFO L388 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 [2021-11-05 12:46:43,977 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2021-11-05 12:46:44,632 INFO L354 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2021-11-05 12:46:44,633 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 20 treesize of output 22 [2021-11-05 12:46:44,801 INFO L388 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 40 treesize of output 20 [2021-11-05 12:46:44,908 INFO L354 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2021-11-05 12:46:44,908 INFO L388 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 48 treesize of output 24 [2021-11-05 12:46:45,727 INFO L354 Elim1Store]: treesize reduction 25, result has 41.9 percent of original size [2021-11-05 12:46:45,727 INFO L388 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 42 treesize of output 50 [2021-11-05 12:46:45,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 12:46:45,871 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-05 12:46:45,872 INFO L388 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 52 treesize of output 47 [2021-11-05 12:46:46,614 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-05 12:46:46,615 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 31 [2021-11-05 12:46:46,852 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-05 12:46:46,852 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 12:46:47,542 INFO L354 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2021-11-05 12:46:47,542 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2021-11-05 12:46:49,759 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| Int) (v_DerPreprocessor_2 Int)) (or (and (= c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.base |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|) (= c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.offset |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.offset|)) (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.offset| v_DerPreprocessor_2)) (.cse1 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.offset|))) (store .cse0 .cse1 (select .cse0 .cse1)))) c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.base) (+ c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.offset 8)) 0)))) is different from false [2021-11-05 12:46:52,112 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| Int) (v_DerPreprocessor_2 Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|) 0 v_DerPreprocessor_2))) (store .cse0 8 (select .cse0 8)))) c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.base) (+ c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.offset 8)) 0)) (and (= c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.base |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|) (= c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.offset 0)))) is different from false [2021-11-05 12:46:55,019 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| Int) (v_DerPreprocessor_2 Int)) (or (and (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.offset| 0) (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|)) (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|) 0 v_DerPreprocessor_2))) (store .cse0 8 (select .cse0 8)))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.base|) (+ |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.offset| 8)) 0)))) is different from false [2021-11-05 12:46:57,129 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int)) (or (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_save_byte_from_array_~storage.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_save_byte_from_array_~storage.base) (+ 8 c_ULTIMATE.start_save_byte_from_array_~storage.offset) v_DerPreprocessor_3)))) (store .cse0 |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| (let ((.cse1 (store (select .cse0 |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|) 0 v_DerPreprocessor_2))) (store .cse1 8 (select .cse1 8))))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.base|) (+ |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.offset| 8)) 0)) (and (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.offset| 0) (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|)))) is different from false [2021-11-05 12:46:59,306 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| Int) (ULTIMATE.start_save_byte_from_array_~storage.offset Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int)) (or (and (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.offset| 0) (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|)) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_save_byte_from_array_~storage.base (store (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_save_byte_from_array_~storage.base) ULTIMATE.start_save_byte_from_array_~storage.offset v_DerPreprocessor_4) (+ 8 ULTIMATE.start_save_byte_from_array_~storage.offset) v_DerPreprocessor_3)))) (store .cse0 |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| (let ((.cse1 (store (select .cse0 |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|) 0 v_DerPreprocessor_2))) (store .cse1 8 (select .cse1 8))))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.base|) (+ |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.offset| 8)) 0)))) is different from false [2021-11-05 12:47:03,566 INFO L354 Elim1Store]: treesize reduction 184, result has 32.8 percent of original size [2021-11-05 12:47:03,566 INFO L388 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 98744 treesize of output 64657 [2021-11-05 12:47:04,032 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-05 12:47:04,035 INFO L388 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 66687 treesize of output 63915 [2021-11-05 12:47:06,781 INFO L388 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 [2021-11-05 12:47:06,847 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-05 12:47:06,848 INFO L388 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 32 treesize of output 36 [2021-11-05 12:47:11,202 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2021-11-05 12:47:11,202 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603611280] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-05 12:47:11,202 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-05 12:47:11,203 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 20] total 42 [2021-11-05 12:47:11,203 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532166073] [2021-11-05 12:47:11,203 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-05 12:47:11,204 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2021-11-05 12:47:11,204 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:47:11,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-11-05 12:47:11,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1171, Unknown=6, NotChecked=370, Total=1722 [2021-11-05 12:47:11,205 INFO L87 Difference]: Start difference. First operand 209 states and 225 transitions. Second operand has 42 states, 42 states have (on average 4.0476190476190474) internal successors, (170), 42 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:47:13,272 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:47:15,393 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:47:17,558 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:47:19,700 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:47:21,833 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:47:23,971 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:47:26,113 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:47:28,184 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:47:31,235 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base) 8)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.base|) 8))) (and (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.offset| 0) (not (= .cse0 c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base)) (= c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset 0) (not (= .cse1 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.base|)) (not (= .cse0 0)) (not (= .cse1 0)) (not (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.base| c_ULTIMATE.start_save_byte_from_array_~storage.base)) (= (select |c_#valid| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.base|) 1) (not (= .cse1 c_ULTIMATE.start_save_byte_from_array_~storage.base)) (forall ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| Int) (ULTIMATE.start_save_byte_from_array_~storage.offset Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int)) (or (and (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.offset| 0) (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|)) (not (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_save_byte_from_array_~storage.base (store (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_save_byte_from_array_~storage.base) ULTIMATE.start_save_byte_from_array_~storage.offset v_DerPreprocessor_4) (+ 8 ULTIMATE.start_save_byte_from_array_~storage.offset) v_DerPreprocessor_3)))) (store .cse2 |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| (let ((.cse3 (store (select .cse2 |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|) 0 v_DerPreprocessor_2))) (store .cse3 8 (select .cse3 8))))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.base|) (+ |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.offset| 8)) 0)))))) is different from false [2021-11-05 12:47:33,241 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.base|) 8))) (and (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.offset| 0) (not (= .cse0 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.base|)) (not (= .cse0 0)) (not (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.base| c_ULTIMATE.start_save_byte_from_array_~storage.base)) (= (select |c_#valid| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.base|) 1) (not (= .cse0 c_ULTIMATE.start_save_byte_from_array_~storage.base)) (forall ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| Int) (ULTIMATE.start_save_byte_from_array_~storage.offset Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int)) (or (and (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.offset| 0) (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|)) (not (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_save_byte_from_array_~storage.base (store (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_save_byte_from_array_~storage.base) ULTIMATE.start_save_byte_from_array_~storage.offset v_DerPreprocessor_4) (+ 8 ULTIMATE.start_save_byte_from_array_~storage.offset) v_DerPreprocessor_3)))) (store .cse1 |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| (let ((.cse2 (store (select .cse1 |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|) 0 v_DerPreprocessor_2))) (store .cse2 8 (select .cse2 8))))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.base|) (+ |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.offset| 8)) 0)))))) is different from false [2021-11-05 12:47:35,247 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.base|) 8))) (and (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.offset| 0) (not (= .cse0 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.base|)) (not (= .cse0 0)) (forall ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int)) (or (not (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_save_byte_from_array_~storage.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_save_byte_from_array_~storage.base) (+ 8 c_ULTIMATE.start_save_byte_from_array_~storage.offset) v_DerPreprocessor_3)))) (store .cse1 |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| (let ((.cse2 (store (select .cse1 |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|) 0 v_DerPreprocessor_2))) (store .cse2 8 (select .cse2 8))))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.base|) (+ |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.offset| 8)) 0)) (and (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.offset| 0) (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|)))) (not (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.base| c_ULTIMATE.start_save_byte_from_array_~storage.base)) (= (select |c_#valid| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.base|) 1) (not (= .cse0 c_ULTIMATE.start_save_byte_from_array_~storage.base)))) is different from false [2021-11-05 12:47:37,253 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.base|) 8))) (and (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.offset| 0) (not (= .cse0 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.base|)) (forall ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| Int) (v_DerPreprocessor_2 Int)) (or (and (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.offset| 0) (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|)) (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|) 0 v_DerPreprocessor_2))) (store .cse1 8 (select .cse1 8)))) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.base|) (+ |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.offset| 8)) 0)))) (not (= .cse0 0)) (= (select |c_#valid| |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_harness_~#cur~3.base|) 1))) is different from false [2021-11-05 12:47:39,259 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.base) 8))) (and (not (= (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base) 8) 0)) (= c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.offset 0) (= (select |c_#valid| c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base) 1) (not (= .cse0 0)) (not (= c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.base .cse0)) (forall ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| Int) (v_DerPreprocessor_2 Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|) 0 v_DerPreprocessor_2))) (store .cse1 8 (select .cse1 8)))) c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.base) (+ c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.offset 8)) 0)) (and (= c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.base |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|) (= c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.offset 0)))) (= c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.base c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base))) is different from false [2021-11-05 12:47:41,282 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.base) 8))) (and (= (select |c_#valid| c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.base) 1) (= c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.offset 0) (not (= .cse0 0)) (not (= c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.base .cse0)) (forall ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| Int) (v_DerPreprocessor_2 Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|) 0 v_DerPreprocessor_2))) (store .cse1 8 (select .cse1 8)))) c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.base) (+ c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.offset 8)) 0)) (and (= c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.base |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|) (= c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.offset 0)))))) is different from false [2021-11-05 12:47:43,368 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.base) 8))) (and (= c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.offset 0) (not (= .cse0 0)) (not (= c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.base |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|)) (forall ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| Int) (v_DerPreprocessor_2 Int)) (or (and (= c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.base |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|) (= c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.offset |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.offset|)) (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.offset| v_DerPreprocessor_2)) (.cse2 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.offset|))) (store .cse1 .cse2 (select .cse1 .cse2)))) c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.base) (+ c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.offset 8)) 0)))) (not (= c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.base .cse0)) (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.offset| 0))) is different from false [2021-11-05 12:47:45,401 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.base) 8))) (and (= c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.offset 0) (not (= .cse0 0)) (not (= c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.base |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|)) (forall ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| Int) (v_DerPreprocessor_2 Int)) (or (and (= c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.base |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|) (= c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.offset |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.offset|)) (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|) |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.offset| v_DerPreprocessor_2)) (.cse2 (+ 8 |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.offset|))) (store .cse1 .cse2 (select .cse1 .cse2)))) c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.base) (+ c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.offset 8)) 0)))) (not (= c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~source.base .cse0)) (= |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.offset| 0) (or (and |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_#t~short995| (exists ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| Int)) (< 0 (mod (select (select |c_#memory_int| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|) 0) 18446744073709551616)))) (and (exists ((|ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base| Int)) (<= (mod (select (select |c_#memory_int| |ULTIMATE.start_aws_byte_cursor_left_trim_pred_~#trimmed~1.base|) 0) 18446744073709551616) 0)) (not |c_ULTIMATE.start_aws_byte_cursor_left_trim_pred_#t~short995|))))) is different from false [2021-11-05 12:47:46,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:47:46,990 INFO L93 Difference]: Finished difference Result 304 states and 327 transitions. [2021-11-05 12:47:46,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-11-05 12:47:46,990 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 4.0476190476190474) internal successors, (170), 42 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-11-05 12:47:46,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:47:46,991 INFO L225 Difference]: With dead ends: 304 [2021-11-05 12:47:46,991 INFO L226 Difference]: Without dead ends: 230 [2021-11-05 12:47:46,992 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 32537.33ms TimeCoverageRelationStatistics Valid=311, Invalid=1889, Unknown=14, NotChecked=1326, Total=3540 [2021-11-05 12:47:46,992 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 152 mSDsluCounter, 1322 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 20 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17379.15ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 1423 SdHoareTripleChecker+Invalid, 1244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 11.83ms SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 728 IncrementalHoareTripleChecker+Unchecked, 18506.30ms IncrementalHoareTripleChecker+Time [2021-11-05 12:47:46,992 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [152 Valid, 1423 Invalid, 1244 Unknown, 0 Unchecked, 11.83ms Time], IncrementalHoareTripleChecker [20 Valid, 488 Invalid, 8 Unknown, 728 Unchecked, 18506.30ms Time] [2021-11-05 12:47:46,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2021-11-05 12:47:47,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 202. [2021-11-05 12:47:47,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 198 states have (on average 1.095959595959596) internal successors, (217), 201 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:47:47,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 217 transitions. [2021-11-05 12:47:47,001 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 217 transitions. Word has length 65 [2021-11-05 12:47:47,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:47:47,001 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 217 transitions. [2021-11-05 12:47:47,001 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 4.0476190476190474) internal successors, (170), 42 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:47:47,001 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 217 transitions. [2021-11-05 12:47:47,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-05 12:47:47,002 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:47:47,002 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 12:47:47,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-11-05 12:47:47,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-11-05 12:47:47,211 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-05 12:47:47,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:47:47,212 INFO L85 PathProgramCache]: Analyzing trace with hash -23690172, now seen corresponding path program 1 times [2021-11-05 12:47:47,212 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:47:47,212 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627601964] [2021-11-05 12:47:47,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:47:47,212 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:47:47,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:47:47,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 12:47:47,884 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:47:47,884 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627601964] [2021-11-05 12:47:47,884 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627601964] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:47:47,884 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:47:47,884 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-05 12:47:47,885 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491129122] [2021-11-05 12:47:47,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:47:47,885 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-05 12:47:47,885 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:47:47,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-05 12:47:47,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-05 12:47:47,885 INFO L87 Difference]: Start difference. First operand 202 states and 217 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:47:49,932 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:47:52,061 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:47:54,208 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:47:55,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:47:55,781 INFO L93 Difference]: Finished difference Result 351 states and 375 transitions. [2021-11-05 12:47:55,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-05 12:47:55,782 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2021-11-05 12:47:55,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:47:55,782 INFO L225 Difference]: With dead ends: 351 [2021-11-05 12:47:55,782 INFO L226 Difference]: Without dead ends: 287 [2021-11-05 12:47:55,783 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 493.47ms TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2021-11-05 12:47:55,783 INFO L933 BasicCegarLoop]: 155 mSDtfsCounter, 208 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 17 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7078.33ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.08ms SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7579.61ms IncrementalHoareTripleChecker+Time [2021-11-05 12:47:55,783 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 553 Invalid, 370 Unknown, 0 Unchecked, 7.08ms Time], IncrementalHoareTripleChecker [17 Valid, 350 Invalid, 3 Unknown, 0 Unchecked, 7579.61ms Time] [2021-11-05 12:47:55,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2021-11-05 12:47:55,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 202. [2021-11-05 12:47:55,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 198 states have (on average 1.0909090909090908) internal successors, (216), 201 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:47:55,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 216 transitions. [2021-11-05 12:47:55,792 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 216 transitions. Word has length 69 [2021-11-05 12:47:55,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:47:55,792 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 216 transitions. [2021-11-05 12:47:55,793 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:47:55,793 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 216 transitions. [2021-11-05 12:47:55,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-05 12:47:55,793 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:47:55,793 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 12:47:55,793 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-05 12:47:55,793 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-05 12:47:55,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:47:55,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1058361341, now seen corresponding path program 1 times [2021-11-05 12:47:55,794 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:47:55,794 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899005208] [2021-11-05 12:47:55,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:47:55,794 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:47:56,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:47:56,474 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-05 12:47:56,474 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:47:56,474 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899005208] [2021-11-05 12:47:56,474 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899005208] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:47:56,474 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:47:56,474 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-05 12:47:56,474 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466389631] [2021-11-05 12:47:56,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:47:56,475 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-05 12:47:56,475 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:47:56,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-05 12:47:56,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-05 12:47:56,475 INFO L87 Difference]: Start difference. First operand 202 states and 216 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:47:58,658 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:48:00,791 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:48:01,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:48:01,411 INFO L93 Difference]: Finished difference Result 288 states and 308 transitions. [2021-11-05 12:48:01,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-05 12:48:01,412 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-11-05 12:48:01,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:48:01,412 INFO L225 Difference]: With dead ends: 288 [2021-11-05 12:48:01,412 INFO L226 Difference]: Without dead ends: 224 [2021-11-05 12:48:01,413 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 157.79ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-05 12:48:01,413 INFO L933 BasicCegarLoop]: 121 mSDtfsCounter, 47 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4555.88ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.55ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4855.41ms IncrementalHoareTripleChecker+Time [2021-11-05 12:48:01,413 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 375 Invalid, 142 Unknown, 0 Unchecked, 2.55ms Time], IncrementalHoareTripleChecker [1 Valid, 139 Invalid, 2 Unknown, 0 Unchecked, 4855.41ms Time] [2021-11-05 12:48:01,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2021-11-05 12:48:01,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 218. [2021-11-05 12:48:01,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 214 states have (on average 1.088785046728972) internal successors, (233), 217 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:48:01,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 233 transitions. [2021-11-05 12:48:01,421 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 233 transitions. Word has length 72 [2021-11-05 12:48:01,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:48:01,422 INFO L470 AbstractCegarLoop]: Abstraction has 218 states and 233 transitions. [2021-11-05 12:48:01,422 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:48:01,422 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 233 transitions. [2021-11-05 12:48:01,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-11-05 12:48:01,422 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:48:01,423 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 12:48:01,423 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-05 12:48:01,423 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-05 12:48:01,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:48:01,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1034320377, now seen corresponding path program 1 times [2021-11-05 12:48:01,424 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:48:01,424 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882783736] [2021-11-05 12:48:01,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:48:01,424 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:48:01,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:48:02,545 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 12:48:02,545 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:48:02,545 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882783736] [2021-11-05 12:48:02,545 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882783736] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-05 12:48:02,546 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071424623] [2021-11-05 12:48:02,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:48:02,546 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 12:48:02,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 12:48:02,552 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-05 12:48:02,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-05 12:48:03,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:48:03,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 2991 conjuncts, 87 conjunts are in the unsatisfiable core [2021-11-05 12:48:03,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 12:48:03,708 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-05 12:48:04,055 INFO L354 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2021-11-05 12:48:04,055 INFO L388 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 25 treesize of output 23 [2021-11-05 12:48:04,263 INFO L354 Elim1Store]: treesize reduction 33, result has 34.0 percent of original size [2021-11-05 12:48:04,263 INFO L388 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 39 treesize of output 31 [2021-11-05 12:48:05,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 12:48:05,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 12:48:05,127 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-05 12:48:05,129 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-05 12:48:05,129 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 52 treesize of output 43 [2021-11-05 12:48:05,136 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-05 12:48:05,176 INFO L354 Elim1Store]: treesize reduction 25, result has 34.2 percent of original size [2021-11-05 12:48:05,176 INFO L388 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 37 treesize of output 28 [2021-11-05 12:48:05,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 12:48:05,297 INFO L354 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2021-11-05 12:48:05,297 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 39 treesize of output 35 [2021-11-05 12:48:07,283 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-05 12:48:07,283 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 26 [2021-11-05 12:48:07,448 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 12:48:07,448 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-05 12:48:10,673 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-05 12:48:10,673 INFO L388 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 146 treesize of output 160 [2021-11-05 12:48:10,753 INFO L388 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 [2021-11-05 12:48:11,048 INFO L388 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 9 treesize of output 7 [2021-11-05 12:48:11,145 INFO L388 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 9 treesize of output 7 [2021-11-05 12:48:11,218 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-05 12:48:11,219 INFO L388 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 17 treesize of output 21 [2021-11-05 12:48:11,499 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-05 12:48:11,500 INFO L388 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 72 treesize of output 88 [2021-11-05 12:48:17,924 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-05 12:48:18,555 INFO L354 Elim1Store]: treesize reduction 268, result has 32.0 percent of original size [2021-11-05 12:48:18,555 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 3633 treesize of output 3565 [2021-11-05 12:48:18,760 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-05 12:48:18,760 INFO L388 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 3177 treesize of output 3001 [2021-11-05 12:48:20,035 INFO L388 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 [2021-11-05 12:48:21,971 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-05 12:48:22,004 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-05 12:48:22,005 INFO L388 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 58 treesize of output 56 [2021-11-05 12:48:24,243 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 12:48:24,243 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071424623] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-05 12:48:24,244 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-05 12:48:24,244 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 19, 19] total 48 [2021-11-05 12:48:24,244 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842831137] [2021-11-05 12:48:24,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-05 12:48:24,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2021-11-05 12:48:24,244 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:48:24,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-11-05 12:48:24,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=2062, Unknown=2, NotChecked=0, Total=2256 [2021-11-05 12:48:24,245 INFO L87 Difference]: Start difference. First operand 218 states and 233 transitions. Second operand has 48 states, 48 states have (on average 4.270833333333333) internal successors, (205), 48 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:48:26,291 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:48:28,433 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:48:30,576 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:48:32,744 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:48:34,924 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:48:37,070 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:48:39,210 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:48:54,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:48:54,398 INFO L93 Difference]: Finished difference Result 405 states and 431 transitions. [2021-11-05 12:48:54,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2021-11-05 12:48:54,399 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 4.270833333333333) internal successors, (205), 48 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-11-05 12:48:54,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:48:54,400 INFO L225 Difference]: With dead ends: 405 [2021-11-05 12:48:54,400 INFO L226 Difference]: Without dead ends: 327 [2021-11-05 12:48:54,403 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 123 SyntacticMatches, 5 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2943 ImplicationChecksByTransitivity, 22335.78ms TimeCoverageRelationStatistics Valid=1441, Invalid=9063, Unknown=2, NotChecked=0, Total=10506 [2021-11-05 12:48:54,403 INFO L933 BasicCegarLoop]: 133 mSDtfsCounter, 1449 mSDsluCounter, 1738 mSDsCounter, 0 mSdLazyCounter, 1334 mSolverCounterSat, 220 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17503.79ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1449 SdHoareTripleChecker+Valid, 1871 SdHoareTripleChecker+Invalid, 2018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 20.02ms SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 1334 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 457 IncrementalHoareTripleChecker+Unchecked, 18749.38ms IncrementalHoareTripleChecker+Time [2021-11-05 12:48:54,403 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1449 Valid, 1871 Invalid, 2018 Unknown, 0 Unchecked, 20.02ms Time], IncrementalHoareTripleChecker [220 Valid, 1334 Invalid, 7 Unknown, 457 Unchecked, 18749.38ms Time] [2021-11-05 12:48:54,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2021-11-05 12:48:54,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 218. [2021-11-05 12:48:54,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 214 states have (on average 1.0794392523364487) internal successors, (231), 217 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:48:54,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 231 transitions. [2021-11-05 12:48:54,421 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 231 transitions. Word has length 74 [2021-11-05 12:48:54,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:48:54,421 INFO L470 AbstractCegarLoop]: Abstraction has 218 states and 231 transitions. [2021-11-05 12:48:54,421 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 4.270833333333333) internal successors, (205), 48 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:48:54,421 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 231 transitions. [2021-11-05 12:48:54,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-05 12:48:54,422 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:48:54,422 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 12:48:54,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-11-05 12:48:54,635 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-11-05 12:48:54,636 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-05 12:48:54,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:48:54,636 INFO L85 PathProgramCache]: Analyzing trace with hash 144726291, now seen corresponding path program 1 times [2021-11-05 12:48:54,636 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:48:54,636 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870099426] [2021-11-05 12:48:54,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:48:54,636 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:48:57,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:48:58,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 12:48:58,344 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:48:58,344 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870099426] [2021-11-05 12:48:58,344 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870099426] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:48:58,344 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:48:58,344 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-05 12:48:58,344 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307914748] [2021-11-05 12:48:58,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:48:58,345 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-05 12:48:58,345 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:48:58,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-05 12:48:58,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-11-05 12:48:58,346 INFO L87 Difference]: Start difference. First operand 218 states and 231 transitions. Second operand has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:49:00,403 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:49:02,538 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:49:04,678 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:49:06,828 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:49:08,989 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:49:11,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:49:11,694 INFO L93 Difference]: Finished difference Result 292 states and 307 transitions. [2021-11-05 12:49:11,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-05 12:49:11,695 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2021-11-05 12:49:11,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:49:11,696 INFO L225 Difference]: With dead ends: 292 [2021-11-05 12:49:11,696 INFO L226 Difference]: Without dead ends: 245 [2021-11-05 12:49:11,696 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 1699.98ms TimeCoverageRelationStatistics Valid=201, Invalid=555, Unknown=0, NotChecked=0, Total=756 [2021-11-05 12:49:11,697 INFO L933 BasicCegarLoop]: 136 mSDtfsCounter, 343 mSDsluCounter, 859 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 27 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11328.70ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 995 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.77ms SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12125.39ms IncrementalHoareTripleChecker+Time [2021-11-05 12:49:11,697 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [343 Valid, 995 Invalid, 588 Unknown, 0 Unchecked, 5.77ms Time], IncrementalHoareTripleChecker [27 Valid, 556 Invalid, 5 Unknown, 0 Unchecked, 12125.39ms Time] [2021-11-05 12:49:11,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2021-11-05 12:49:11,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 213. [2021-11-05 12:49:11,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 209 states have (on average 1.0717703349282297) internal successors, (224), 212 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:49:11,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 224 transitions. [2021-11-05 12:49:11,706 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 224 transitions. Word has length 75 [2021-11-05 12:49:11,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:49:11,706 INFO L470 AbstractCegarLoop]: Abstraction has 213 states and 224 transitions. [2021-11-05 12:49:11,706 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:49:11,707 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 224 transitions. [2021-11-05 12:49:11,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-11-05 12:49:11,707 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:49:11,707 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 12:49:11,707 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-05 12:49:11,708 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-05 12:49:11,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:49:11,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1442971818, now seen corresponding path program 1 times [2021-11-05 12:49:11,708 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:49:11,708 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238068184] [2021-11-05 12:49:11,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:49:11,708 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:49:11,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:49:12,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 12:49:12,367 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:49:12,367 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238068184] [2021-11-05 12:49:12,367 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238068184] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:49:12,367 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:49:12,367 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-05 12:49:12,367 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379577110] [2021-11-05 12:49:12,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:49:12,367 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-05 12:49:12,367 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:49:12,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-05 12:49:12,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-05 12:49:12,368 INFO L87 Difference]: Start difference. First operand 213 states and 224 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:49:14,410 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:49:16,644 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:49:18,820 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:49:19,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:49:19,739 INFO L93 Difference]: Finished difference Result 243 states and 255 transitions. [2021-11-05 12:49:19,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-05 12:49:19,739 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-11-05 12:49:19,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:49:19,740 INFO L225 Difference]: With dead ends: 243 [2021-11-05 12:49:19,740 INFO L226 Difference]: Without dead ends: 230 [2021-11-05 12:49:19,740 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 479.52ms TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-11-05 12:49:19,740 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 253 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 7 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6534.89ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.22ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7071.57ms IncrementalHoareTripleChecker+Time [2021-11-05 12:49:19,741 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [253 Valid, 478 Invalid, 172 Unknown, 0 Unchecked, 2.22ms Time], IncrementalHoareTripleChecker [7 Valid, 162 Invalid, 3 Unknown, 0 Unchecked, 7071.57ms Time] [2021-11-05 12:49:19,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2021-11-05 12:49:19,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 228. [2021-11-05 12:49:19,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 224 states have (on average 1.0669642857142858) internal successors, (239), 227 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:49:19,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 239 transitions. [2021-11-05 12:49:19,750 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 239 transitions. Word has length 76 [2021-11-05 12:49:19,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:49:19,750 INFO L470 AbstractCegarLoop]: Abstraction has 228 states and 239 transitions. [2021-11-05 12:49:19,750 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:49:19,750 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 239 transitions. [2021-11-05 12:49:19,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-11-05 12:49:19,751 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:49:19,751 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 12:49:19,751 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-05 12:49:19,751 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-05 12:49:19,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:49:19,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1271940535, now seen corresponding path program 1 times [2021-11-05 12:49:19,751 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:49:19,751 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287066930] [2021-11-05 12:49:19,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:49:19,752 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:49:19,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:49:20,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 12:49:20,265 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:49:20,265 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287066930] [2021-11-05 12:49:20,265 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287066930] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:49:20,265 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:49:20,265 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-05 12:49:20,265 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824816152] [2021-11-05 12:49:20,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:49:20,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-05 12:49:20,266 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:49:20,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-05 12:49:20,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-05 12:49:20,266 INFO L87 Difference]: Start difference. First operand 228 states and 239 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:49:22,316 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:49:24,468 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:49:26,580 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:49:27,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:49:27,769 INFO L93 Difference]: Finished difference Result 299 states and 312 transitions. [2021-11-05 12:49:27,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-05 12:49:27,770 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-11-05 12:49:27,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:49:27,771 INFO L225 Difference]: With dead ends: 299 [2021-11-05 12:49:27,771 INFO L226 Difference]: Without dead ends: 233 [2021-11-05 12:49:27,771 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 432.79ms TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2021-11-05 12:49:27,772 INFO L933 BasicCegarLoop]: 124 mSDtfsCounter, 111 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 10 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6758.85ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.32ms SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7177.52ms IncrementalHoareTripleChecker+Time [2021-11-05 12:49:27,772 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 583 Invalid, 257 Unknown, 0 Unchecked, 3.32ms Time], IncrementalHoareTripleChecker [10 Valid, 244 Invalid, 3 Unknown, 0 Unchecked, 7177.52ms Time] [2021-11-05 12:49:27,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2021-11-05 12:49:27,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 211. [2021-11-05 12:49:27,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 207 states have (on average 1.0821256038647342) internal successors, (224), 210 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:49:27,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 224 transitions. [2021-11-05 12:49:27,785 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 224 transitions. Word has length 76 [2021-11-05 12:49:27,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:49:27,785 INFO L470 AbstractCegarLoop]: Abstraction has 211 states and 224 transitions. [2021-11-05 12:49:27,785 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:49:27,786 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 224 transitions. [2021-11-05 12:49:27,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-11-05 12:49:27,790 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:49:27,790 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 12:49:27,791 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-05 12:49:27,791 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-05 12:49:27,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:49:27,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1038906120, now seen corresponding path program 1 times [2021-11-05 12:49:27,791 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:49:27,792 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62852467] [2021-11-05 12:49:27,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:49:27,792 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:49:31,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:49:32,167 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-05 12:49:32,167 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:49:32,167 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62852467] [2021-11-05 12:49:32,167 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62852467] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:49:32,167 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:49:32,168 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-05 12:49:32,168 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881263340] [2021-11-05 12:49:32,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:49:32,168 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-11-05 12:49:32,168 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:49:32,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-05 12:49:32,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2021-11-05 12:49:32,168 INFO L87 Difference]: Start difference. First operand 211 states and 224 transitions. Second operand has 16 states, 16 states have (on average 4.75) internal successors, (76), 16 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:49:34,211 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:49:36,369 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:49:38,495 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:49:40,671 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:49:42,788 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:49:44,916 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:49:47,058 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:49:50,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:49:50,476 INFO L93 Difference]: Finished difference Result 262 states and 278 transitions. [2021-11-05 12:49:50,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-11-05 12:49:50,477 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.75) internal successors, (76), 16 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-11-05 12:49:50,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:49:50,478 INFO L225 Difference]: With dead ends: 262 [2021-11-05 12:49:50,478 INFO L226 Difference]: Without dead ends: 200 [2021-11-05 12:49:50,478 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 2769.73ms TimeCoverageRelationStatistics Valid=359, Invalid=973, Unknown=0, NotChecked=0, Total=1332 [2021-11-05 12:49:50,479 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 503 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 68 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14979.97ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.60ms SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15990.84ms IncrementalHoareTripleChecker+Time [2021-11-05 12:49:50,479 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [503 Valid, 382 Invalid, 422 Unknown, 0 Unchecked, 4.60ms Time], IncrementalHoareTripleChecker [68 Valid, 347 Invalid, 7 Unknown, 0 Unchecked, 15990.84ms Time] [2021-11-05 12:49:50,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2021-11-05 12:49:50,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 156. [2021-11-05 12:49:50,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 154 states have (on average 1.051948051948052) internal successors, (162), 155 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:49:50,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 162 transitions. [2021-11-05 12:49:50,486 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 162 transitions. Word has length 80 [2021-11-05 12:49:50,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:49:50,487 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 162 transitions. [2021-11-05 12:49:50,487 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.75) internal successors, (76), 16 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:49:50,487 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 162 transitions. [2021-11-05 12:49:50,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-11-05 12:49:50,487 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:49:50,488 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 12:49:50,488 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-05 12:49:50,488 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-05 12:49:50,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:49:50,488 INFO L85 PathProgramCache]: Analyzing trace with hash 2124225498, now seen corresponding path program 1 times [2021-11-05 12:49:50,488 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:49:50,489 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238203827] [2021-11-05 12:49:50,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:49:50,489 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:49:50,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:49:51,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 12:49:51,209 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:49:51,209 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238203827] [2021-11-05 12:49:51,209 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238203827] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:49:51,209 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:49:51,209 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-05 12:49:51,209 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807549218] [2021-11-05 12:49:51,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:49:51,210 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-05 12:49:51,210 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:49:51,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-05 12:49:51,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-11-05 12:49:51,210 INFO L87 Difference]: Start difference. First operand 156 states and 162 transitions. Second operand has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:49:53,304 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:49:55,591 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:49:56,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:49:56,604 INFO L93 Difference]: Finished difference Result 230 states and 240 transitions. [2021-11-05 12:49:56,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-05 12:49:56,605 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2021-11-05 12:49:56,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:49:56,606 INFO L225 Difference]: With dead ends: 230 [2021-11-05 12:49:56,606 INFO L226 Difference]: Without dead ends: 186 [2021-11-05 12:49:56,606 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 454.79ms TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2021-11-05 12:49:56,607 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 272 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 22 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4665.37ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.12ms SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5132.76ms IncrementalHoareTripleChecker+Time [2021-11-05 12:49:56,607 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [272 Valid, 356 Invalid, 237 Unknown, 0 Unchecked, 2.12ms Time], IncrementalHoareTripleChecker [22 Valid, 213 Invalid, 2 Unknown, 0 Unchecked, 5132.76ms Time] [2021-11-05 12:49:56,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2021-11-05 12:49:56,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 175. [2021-11-05 12:49:56,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 173 states have (on average 1.0520231213872833) internal successors, (182), 174 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:49:56,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 182 transitions. [2021-11-05 12:49:56,615 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 182 transitions. Word has length 90 [2021-11-05 12:49:56,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:49:56,616 INFO L470 AbstractCegarLoop]: Abstraction has 175 states and 182 transitions. [2021-11-05 12:49:56,616 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:49:56,616 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 182 transitions. [2021-11-05 12:49:56,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-11-05 12:49:56,616 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:49:56,616 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 12:49:56,617 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-05 12:49:56,617 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-05 12:49:56,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:49:56,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1518276033, now seen corresponding path program 1 times [2021-11-05 12:49:56,617 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:49:56,617 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122130899] [2021-11-05 12:49:56,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:49:56,618 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:49:57,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:49:57,587 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-05 12:49:57,587 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:49:57,587 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122130899] [2021-11-05 12:49:57,587 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122130899] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:49:57,587 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:49:57,587 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-05 12:49:57,587 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880774238] [2021-11-05 12:49:57,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:49:57,588 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-05 12:49:57,588 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:49:57,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-05 12:49:57,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-11-05 12:49:57,588 INFO L87 Difference]: Start difference. First operand 175 states and 182 transitions. Second operand has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:49:59,632 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:50:01,772 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:50:03,944 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:50:06,077 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:50:07,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:50:07,272 INFO L93 Difference]: Finished difference Result 212 states and 220 transitions. [2021-11-05 12:50:07,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-05 12:50:07,273 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2021-11-05 12:50:07,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:50:07,273 INFO L225 Difference]: With dead ends: 212 [2021-11-05 12:50:07,273 INFO L226 Difference]: Without dead ends: 175 [2021-11-05 12:50:07,274 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 519.80ms TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2021-11-05 12:50:07,274 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 199 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 20 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8687.45ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.77ms SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9335.55ms IncrementalHoareTripleChecker+Time [2021-11-05 12:50:07,274 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [199 Valid, 261 Invalid, 244 Unknown, 0 Unchecked, 2.77ms Time], IncrementalHoareTripleChecker [20 Valid, 220 Invalid, 4 Unknown, 0 Unchecked, 9335.55ms Time] [2021-11-05 12:50:07,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2021-11-05 12:50:07,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2021-11-05 12:50:07,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 173 states have (on average 1.0404624277456647) internal successors, (180), 174 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:50:07,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 180 transitions. [2021-11-05 12:50:07,282 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 180 transitions. Word has length 93 [2021-11-05 12:50:07,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:50:07,283 INFO L470 AbstractCegarLoop]: Abstraction has 175 states and 180 transitions. [2021-11-05 12:50:07,283 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:50:07,283 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 180 transitions. [2021-11-05 12:50:07,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-11-05 12:50:07,284 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:50:07,284 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 12:50:07,284 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-05 12:50:07,284 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-05 12:50:07,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:50:07,285 INFO L85 PathProgramCache]: Analyzing trace with hash -616554032, now seen corresponding path program 1 times [2021-11-05 12:50:07,286 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:50:07,286 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878287945] [2021-11-05 12:50:07,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:50:07,286 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:50:13,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:50:26,753 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 12:50:26,753 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:50:26,753 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878287945] [2021-11-05 12:50:26,753 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878287945] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-05 12:50:26,753 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848371939] [2021-11-05 12:50:26,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:50:26,753 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 12:50:26,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 12:50:26,755 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-05 12:50:26,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-05 12:55:07,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:55:07,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 3095 conjuncts, 179 conjunts are in the unsatisfiable core [2021-11-05 12:55:07,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-05 12:55:07,936 INFO L388 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 [2021-11-05 12:55:08,705 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-05 12:55:08,705 INFO L388 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 [2021-11-05 12:55:09,294 INFO L388 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 25 treesize of output 13 [2021-11-05 12:55:09,319 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2021-11-05 12:55:09,351 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-05 12:55:10,891 INFO L354 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2021-11-05 12:55:10,891 INFO L388 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 5 case distinctions, treesize of input 36 treesize of output 43 [2021-11-05 12:55:11,483 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-05 12:55:11,484 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 32 treesize of output 16 [2021-11-05 12:55:11,532 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 60 treesize of output 51 [2021-11-05 12:55:11,575 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-05 12:55:11,576 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 44 treesize of output 28 [2021-11-05 12:55:12,663 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-05 12:55:12,695 INFO L354 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2021-11-05 12:55:12,695 INFO L388 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 29 treesize of output 17 [2021-11-05 12:55:12,746 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-05 12:55:12,785 INFO L354 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2021-11-05 12:55:12,786 INFO L388 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 146 treesize of output 118 [2021-11-05 12:55:12,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 12:55:12,966 INFO L354 Elim1Store]: treesize reduction 272, result has 16.3 percent of original size [2021-11-05 12:55:12,966 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 127 treesize of output 163 [2021-11-05 12:55:13,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 12:55:13,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 12:55:13,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 12:55:13,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 12:55:13,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 12:55:13,097 INFO L354 Elim1Store]: treesize reduction 49, result has 34.7 percent of original size [2021-11-05 12:55:13,097 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 112 treesize of output 84 [2021-11-05 12:55:13,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 12:55:13,921 INFO L354 Elim1Store]: treesize reduction 70, result has 28.6 percent of original size [2021-11-05 12:55:13,921 INFO L388 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 8 case distinctions, treesize of input 43 treesize of output 61 [2021-11-05 12:55:17,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 12:55:17,804 INFO L354 Elim1Store]: treesize reduction 60, result has 17.8 percent of original size [2021-11-05 12:55:17,805 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 61 treesize of output 63 [2021-11-05 12:55:19,110 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 136 [2021-11-05 12:55:19,118 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 126 [2021-11-05 12:55:19,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 12:55:19,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 12:55:19,187 INFO L354 Elim1Store]: treesize reduction 193, result has 6.3 percent of original size [2021-11-05 12:55:19,188 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 144 treesize of output 132 [2021-11-05 12:55:19,335 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 35 [2021-11-05 12:55:19,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 12:55:19,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-05 12:55:19,358 INFO L388 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 29 treesize of output 28 [2021-11-05 12:55:27,007 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base] [2021-11-05 12:55:27,007 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-05 12:55:27,007 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2021-11-05 12:55:27,007 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499231043] [2021-11-05 12:55:27,008 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-05 12:55:27,008 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-11-05 12:55:27,008 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:55:27,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-11-05 12:55:27,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=2295, Unknown=0, NotChecked=0, Total=2450 [2021-11-05 12:55:27,009 INFO L87 Difference]: Start difference. First operand 175 states and 180 transitions. Second operand has 31 states, 31 states have (on average 3.193548387096774) internal successors, (99), 31 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:55:29,059 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:55:31,181 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:55:33,363 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:55:35,509 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:55:37,668 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:55:39,785 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:55:41,937 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:55:44,051 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:55:46,218 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:55:48,384 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:55:50,490 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:55:52,637 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:55:54,810 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:55:56,978 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:55:59,134 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:56:01,261 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:56:03,372 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:56:12,679 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:56:49,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:56:49,838 INFO L93 Difference]: Finished difference Result 266 states and 273 transitions. [2021-11-05 12:56:49,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-11-05 12:56:49,838 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.193548387096774) internal successors, (99), 31 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2021-11-05 12:56:49,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:56:49,839 INFO L225 Difference]: With dead ends: 266 [2021-11-05 12:56:49,839 INFO L226 Difference]: Without dead ends: 218 [2021-11-05 12:56:49,840 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 63 SyntacticMatches, 4 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1119 ImplicationChecksByTransitivity, 50176.60ms TimeCoverageRelationStatistics Valid=530, Invalid=4872, Unknown=0, NotChecked=0, Total=5402 [2021-11-05 12:56:49,841 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 792 mSDsluCounter, 1331 mSDsCounter, 0 mSdLazyCounter, 1413 mSolverCounterSat, 108 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 42353.03ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 1410 SdHoareTripleChecker+Invalid, 1539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 15.40ms SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 1413 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 45147.77ms IncrementalHoareTripleChecker+Time [2021-11-05 12:56:49,841 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [792 Valid, 1410 Invalid, 1539 Unknown, 0 Unchecked, 15.40ms Time], IncrementalHoareTripleChecker [108 Valid, 1413 Invalid, 18 Unknown, 0 Unchecked, 45147.77ms Time] [2021-11-05 12:56:49,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2021-11-05 12:56:49,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 177. [2021-11-05 12:56:49,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 175 states have (on average 1.04) internal successors, (182), 176 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:56:49,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 182 transitions. [2021-11-05 12:56:49,853 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 182 transitions. Word has length 99 [2021-11-05 12:56:49,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:56:49,853 INFO L470 AbstractCegarLoop]: Abstraction has 177 states and 182 transitions. [2021-11-05 12:56:49,853 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.193548387096774) internal successors, (99), 31 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:56:49,853 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 182 transitions. [2021-11-05 12:56:49,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-11-05 12:56:49,854 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:56:49,854 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 12:56:49,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-11-05 12:56:50,059 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 12:56:50,059 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-05 12:56:50,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:56:50,060 INFO L85 PathProgramCache]: Analyzing trace with hash -771712428, now seen corresponding path program 1 times [2021-11-05 12:56:50,060 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:56:50,060 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138963482] [2021-11-05 12:56:50,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:56:50,060 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:56:50,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:56:50,802 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 12:56:50,803 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:56:50,803 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138963482] [2021-11-05 12:56:50,803 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138963482] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:56:50,803 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:56:50,803 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-05 12:56:50,803 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844767323] [2021-11-05 12:56:50,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:56:50,803 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-05 12:56:50,803 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:56:50,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-05 12:56:50,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-11-05 12:56:50,804 INFO L87 Difference]: Start difference. First operand 177 states and 182 transitions. Second operand has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:56:52,847 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:56:55,001 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:56:55,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:56:55,830 INFO L93 Difference]: Finished difference Result 232 states and 238 transitions. [2021-11-05 12:56:55,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-05 12:56:55,831 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2021-11-05 12:56:55,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:56:55,831 INFO L225 Difference]: With dead ends: 232 [2021-11-05 12:56:55,832 INFO L226 Difference]: Without dead ends: 188 [2021-11-05 12:56:55,832 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 313.28ms TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2021-11-05 12:56:55,832 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 174 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4505.38ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.23ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4848.67ms IncrementalHoareTripleChecker+Time [2021-11-05 12:56:55,832 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [174 Valid, 358 Invalid, 180 Unknown, 0 Unchecked, 2.23ms Time], IncrementalHoareTripleChecker [8 Valid, 170 Invalid, 2 Unknown, 0 Unchecked, 4848.67ms Time] [2021-11-05 12:56:55,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-11-05 12:56:55,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 161. [2021-11-05 12:56:55,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 159 states have (on average 1.0377358490566038) internal successors, (165), 160 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:56:55,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 165 transitions. [2021-11-05 12:56:55,843 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 165 transitions. Word has length 101 [2021-11-05 12:56:55,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:56:55,843 INFO L470 AbstractCegarLoop]: Abstraction has 161 states and 165 transitions. [2021-11-05 12:56:55,843 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:56:55,843 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 165 transitions. [2021-11-05 12:56:55,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-11-05 12:56:55,844 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:56:55,844 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 12:56:55,844 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-11-05 12:56:55,844 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-05 12:56:55,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:56:55,845 INFO L85 PathProgramCache]: Analyzing trace with hash 836506168, now seen corresponding path program 1 times [2021-11-05 12:56:55,845 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:56:55,845 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606446932] [2021-11-05 12:56:55,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:56:55,845 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:56:56,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:56:56,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 12:56:56,853 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:56:56,853 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606446932] [2021-11-05 12:56:56,853 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606446932] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:56:56,853 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:56:56,853 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-05 12:56:56,854 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388910379] [2021-11-05 12:56:56,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:56:56,854 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-05 12:56:56,854 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:56:56,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-05 12:56:56,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-11-05 12:56:56,854 INFO L87 Difference]: Start difference. First operand 161 states and 165 transitions. Second operand has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:56:58,943 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:57:01,099 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:57:03,221 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:57:05,390 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:57:07,558 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:57:09,713 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:57:11,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:57:11,913 INFO L93 Difference]: Finished difference Result 239 states and 243 transitions. [2021-11-05 12:57:11,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-05 12:57:11,914 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2021-11-05 12:57:11,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:57:11,915 INFO L225 Difference]: With dead ends: 239 [2021-11-05 12:57:11,915 INFO L226 Difference]: Without dead ends: 229 [2021-11-05 12:57:11,915 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1120.11ms TimeCoverageRelationStatistics Valid=126, Invalid=426, Unknown=0, NotChecked=0, Total=552 [2021-11-05 12:57:11,916 INFO L933 BasicCegarLoop]: 88 mSDtfsCounter, 295 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 24 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13259.05ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.15ms SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14251.29ms IncrementalHoareTripleChecker+Time [2021-11-05 12:57:11,916 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [295 Valid, 589 Invalid, 423 Unknown, 0 Unchecked, 5.15ms Time], IncrementalHoareTripleChecker [24 Valid, 393 Invalid, 6 Unknown, 0 Unchecked, 14251.29ms Time] [2021-11-05 12:57:11,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2021-11-05 12:57:11,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 204. [2021-11-05 12:57:11,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 202 states have (on average 1.0297029702970297) internal successors, (208), 203 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:57:11,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 208 transitions. [2021-11-05 12:57:11,932 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 208 transitions. Word has length 102 [2021-11-05 12:57:11,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:57:11,932 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 208 transitions. [2021-11-05 12:57:11,932 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:57:11,932 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 208 transitions. [2021-11-05 12:57:11,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-11-05 12:57:11,933 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:57:11,934 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 12:57:11,934 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-11-05 12:57:11,934 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-05 12:57:11,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:57:11,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1007537451, now seen corresponding path program 1 times [2021-11-05 12:57:11,934 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:57:11,934 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605387133] [2021-11-05 12:57:11,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:57:11,935 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:57:14,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:57:15,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-05 12:57:15,370 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:57:15,370 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605387133] [2021-11-05 12:57:15,370 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605387133] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-05 12:57:15,371 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-05 12:57:15,371 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-05 12:57:15,371 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122572211] [2021-11-05 12:57:15,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-05 12:57:15,371 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-05 12:57:15,371 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-05 12:57:15,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-05 12:57:15,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2021-11-05 12:57:15,371 INFO L87 Difference]: Start difference. First operand 204 states and 208 transitions. Second operand has 18 states, 18 states have (on average 5.666666666666667) internal successors, (102), 18 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:57:17,420 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:57:19,633 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:57:21,766 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:57:23,996 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:57:26,161 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:57:28,347 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:57:30,493 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-05 12:57:34,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-05 12:57:34,646 INFO L93 Difference]: Finished difference Result 228 states and 231 transitions. [2021-11-05 12:57:34,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-11-05 12:57:34,647 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.666666666666667) internal successors, (102), 18 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2021-11-05 12:57:34,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-05 12:57:34,648 INFO L225 Difference]: With dead ends: 228 [2021-11-05 12:57:34,648 INFO L226 Difference]: Without dead ends: 215 [2021-11-05 12:57:34,648 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 3258.97ms TimeCoverageRelationStatistics Valid=369, Invalid=1523, Unknown=0, NotChecked=0, Total=1892 [2021-11-05 12:57:34,649 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 756 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 78 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15317.68ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 756 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.10ms SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16633.47ms IncrementalHoareTripleChecker+Time [2021-11-05 12:57:34,649 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [756 Valid, 565 Invalid, 596 Unknown, 0 Unchecked, 6.10ms Time], IncrementalHoareTripleChecker [78 Valid, 511 Invalid, 7 Unknown, 0 Unchecked, 16633.47ms Time] [2021-11-05 12:57:34,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2021-11-05 12:57:34,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 197. [2021-11-05 12:57:34,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 196 states have (on average 1.0204081632653061) internal successors, (200), 196 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:57:34,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 200 transitions. [2021-11-05 12:57:34,661 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 200 transitions. Word has length 102 [2021-11-05 12:57:34,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-05 12:57:34,661 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 200 transitions. [2021-11-05 12:57:34,661 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.666666666666667) internal successors, (102), 18 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-05 12:57:34,662 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 200 transitions. [2021-11-05 12:57:34,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-11-05 12:57:34,662 INFO L506 BasicCegarLoop]: Found error trace [2021-11-05 12:57:34,662 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-05 12:57:34,662 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-11-05 12:57:34,663 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-05 12:57:34,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-05 12:57:34,663 INFO L85 PathProgramCache]: Analyzing trace with hash 642444485, now seen corresponding path program 2 times [2021-11-05 12:57:34,663 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-05 12:57:34,663 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941708194] [2021-11-05 12:57:34,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-05 12:57:34,663 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-05 12:57:41,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-05 12:57:48,380 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-05 12:57:48,380 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-05 12:57:48,381 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941708194] [2021-11-05 12:57:48,381 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941708194] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-05 12:57:48,381 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424727043] [2021-11-05 12:57:48,381 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-05 12:57:48,381 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-05 12:57:48,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-05 12:57:48,382 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) [2021-11-05 12:57:48,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process Killed by 15