./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_cursor_right_trim_pred_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4d014703 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_right_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 f85fffa00ce152c2185c303de3856b218143afacade5a3da3d11c284e86ce457 --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-4d01470 [2021-11-02 13:18:01,472 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-02 13:18:01,474 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-02 13:18:01,528 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-02 13:18:01,528 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-02 13:18:01,532 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-02 13:18:01,533 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-02 13:18:01,536 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-02 13:18:01,538 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-02 13:18:01,543 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-02 13:18:01,544 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-02 13:18:01,545 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-02 13:18:01,545 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-02 13:18:01,548 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-02 13:18:01,550 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-02 13:18:01,556 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-02 13:18:01,558 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-02 13:18:01,559 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-02 13:18:01,561 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-02 13:18:01,567 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-02 13:18:01,568 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-02 13:18:01,569 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-02 13:18:01,572 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-02 13:18:01,572 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-02 13:18:01,578 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-02 13:18:01,579 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-02 13:18:01,579 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-02 13:18:01,581 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-02 13:18:01,582 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-02 13:18:01,583 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-02 13:18:01,583 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-02 13:18:01,584 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-02 13:18:01,585 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-02 13:18:01,587 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-02 13:18:01,588 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-02 13:18:01,588 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-02 13:18:01,589 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-02 13:18:01,590 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-02 13:18:01,590 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-02 13:18:01,591 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-02 13:18:01,591 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-02 13:18:01,592 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-02 13:18:01,630 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-02 13:18:01,630 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-02 13:18:01,631 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-02 13:18:01,631 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-02 13:18:01,632 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-02 13:18:01,633 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-02 13:18:01,633 INFO L138 SettingsManager]: * Use SBE=true [2021-11-02 13:18:01,633 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-02 13:18:01,633 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-02 13:18:01,634 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-02 13:18:01,635 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-02 13:18:01,635 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-02 13:18:01,635 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-02 13:18:01,635 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-02 13:18:01,636 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-02 13:18:01,636 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-02 13:18:01,636 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-02 13:18:01,636 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-02 13:18:01,636 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-02 13:18:01,637 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 13:18:01,637 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-02 13:18:01,637 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-02 13:18:01,637 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-02 13:18:01,638 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-02 13:18:01,638 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-02 13:18:01,638 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-02 13:18:01,638 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-02 13:18:01,640 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-02 13:18:01,640 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-02 13:18:01,640 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 -> f85fffa00ce152c2185c303de3856b218143afacade5a3da3d11c284e86ce457 [2021-11-02 13:18:01,907 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-02 13:18:01,936 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-02 13:18:01,938 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-02 13:18:01,940 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-02 13:18:01,941 INFO L275 PluginConnector]: CDTParser initialized [2021-11-02 13:18:01,943 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_right_trim_pred_harness.i [2021-11-02 13:18:02,027 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee78674e8/e1a5b5fc7514419f8f8b3d3d26b7dba2/FLAG547634575 [2021-11-02 13:18:02,782 INFO L306 CDTParser]: Found 1 translation units. [2021-11-02 13:18:02,783 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_cursor_right_trim_pred_harness.i [2021-11-02 13:18:02,829 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee78674e8/e1a5b5fc7514419f8f8b3d3d26b7dba2/FLAG547634575 [2021-11-02 13:18:03,339 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee78674e8/e1a5b5fc7514419f8f8b3d3d26b7dba2 [2021-11-02 13:18:03,341 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-02 13:18:03,350 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-02 13:18:03,354 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-02 13:18:03,358 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-02 13:18:03,371 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-02 13:18:03,374 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 01:18:03" (1/1) ... [2021-11-02 13:18:03,375 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6648d3eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:18:03, skipping insertion in model container [2021-11-02 13:18:03,375 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 01:18:03" (1/1) ... [2021-11-02 13:18:03,381 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-02 13:18:03,474 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-02 13:18:03,696 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_right_trim_pred_harness.i[4505,4518] [2021-11-02 13:18:03,702 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_right_trim_pred_harness.i[4565,4578] [2021-11-02 13:18:03,723 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-02 13:18:03,728 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-02 13:18:04,448 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:18:04,451 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:18:04,452 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:18:04,453 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:18:04,454 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:18:04,474 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:18:04,477 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:18:04,480 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:18:04,481 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:18:04,807 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-02 13:18:04,808 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-02 13:18:04,810 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-02 13:18:04,811 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-02 13:18:04,813 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-02 13:18:04,813 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-02 13:18:04,814 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-02 13:18:04,814 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-02 13:18:04,815 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-02 13:18:04,815 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-02 13:18:04,945 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-02 13:18:05,040 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:18:05,041 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:18:05,151 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 13:18:05,204 INFO L203 MainTranslator]: Completed pre-run [2021-11-02 13:18:05,226 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_right_trim_pred_harness.i[4505,4518] [2021-11-02 13:18:05,228 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_right_trim_pred_harness.i[4565,4578] [2021-11-02 13:18:05,230 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-02 13:18:05,232 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-02 13:18:05,263 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:18:05,264 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:18:05,264 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:18:05,265 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:18:05,266 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:18:05,270 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:18:05,271 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:18:05,272 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:18:05,272 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:18:05,314 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-02 13:18:05,315 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-02 13:18:05,315 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-02 13:18:05,315 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-02 13:18:05,316 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-02 13:18:05,317 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-02 13:18:05,317 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-02 13:18:05,317 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-02 13:18:05,318 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-02 13:18:05,318 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-02 13:18:05,341 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-02 13:18:05,393 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:18:05,394 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 13:18:05,419 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 13:18:05,633 INFO L208 MainTranslator]: Completed translation [2021-11-02 13:18:05,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:18:05 WrapperNode [2021-11-02 13:18:05,634 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-02 13:18:05,635 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-02 13:18:05,635 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-02 13:18:05,636 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-02 13:18:05,641 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:18:05" (1/1) ... [2021-11-02 13:18:05,754 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:18:05" (1/1) ... [2021-11-02 13:18:05,851 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-02 13:18:05,853 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-02 13:18:05,853 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-02 13:18:05,853 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-02 13:18:05,861 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:18:05" (1/1) ... [2021-11-02 13:18:05,861 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:18:05" (1/1) ... [2021-11-02 13:18:05,876 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:18:05" (1/1) ... [2021-11-02 13:18:05,877 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:18:05" (1/1) ... [2021-11-02 13:18:05,926 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:18:05" (1/1) ... [2021-11-02 13:18:05,931 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:18:05" (1/1) ... [2021-11-02 13:18:05,938 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:18:05" (1/1) ... [2021-11-02 13:18:05,949 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-02 13:18:05,950 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-02 13:18:05,950 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-02 13:18:05,951 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-02 13:18:05,964 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:18:05" (1/1) ... [2021-11-02 13:18:05,971 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 13:18:05,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-02 13:18:06,013 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-02 13:18:06,035 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-02 13:18:06,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-02 13:18:06,052 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-02 13:18:06,052 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-02 13:18:06,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-02 13:18:06,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-02 13:18:06,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-02 13:18:06,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-02 13:18:06,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-02 13:18:06,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-02 13:18:06,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-02 13:18:06,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-02 13:18:11,877 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-02 13:18:11,877 INFO L299 CfgBuilder]: Removed 61 assume(true) statements. [2021-11-02 13:18:11,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 01:18:11 BoogieIcfgContainer [2021-11-02 13:18:11,880 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-02 13:18:11,881 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-02 13:18:11,881 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-02 13:18:11,885 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-02 13:18:11,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 01:18:03" (1/3) ... [2021-11-02 13:18:11,886 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ce0605 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 01:18:11, skipping insertion in model container [2021-11-02 13:18:11,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 01:18:05" (2/3) ... [2021-11-02 13:18:11,889 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ce0605 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 01:18:11, skipping insertion in model container [2021-11-02 13:18:11,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 01:18:11" (3/3) ... [2021-11-02 13:18:11,891 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_cursor_right_trim_pred_harness.i [2021-11-02 13:18:11,896 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-02 13:18:11,896 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2021-11-02 13:18:11,933 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-02 13:18:11,938 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-02 13:18:11,939 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-11-02 13:18:11,953 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-02 13:18:11,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-02 13:18:11,958 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:18:11,959 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-02 13:18:11,959 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-02 13:18:11,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:18:11,963 INFO L85 PathProgramCache]: Analyzing trace with hash 960385600, now seen corresponding path program 1 times [2021-11-02 13:18:11,971 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:18:11,971 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184430589] [2021-11-02 13:18:11,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:18:11,972 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:18:12,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:18:12,620 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-02 13:18:12,620 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:18:12,620 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184430589] [2021-11-02 13:18:12,621 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184430589] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:18:12,622 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:18:12,622 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-02 13:18:12,623 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401394385] [2021-11-02 13:18:12,628 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-02 13:18:12,628 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:18:12,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-02 13:18:12,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-02 13:18:12,660 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-02 13:18:14,776 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-02 13:18:15,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:18:15,669 INFO L93 Difference]: Finished difference Result 244 states and 337 transitions. [2021-11-02 13:18:15,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-02 13:18:15,672 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-02 13:18:15,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:18:15,679 INFO L225 Difference]: With dead ends: 244 [2021-11-02 13:18:15,679 INFO L226 Difference]: Without dead ends: 117 [2021-11-02 13:18:15,681 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-02 13:18:15,683 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2672.32ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.43ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2953.58ms IncrementalHoareTripleChecker+Time [2021-11-02 13:18:15,684 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 159 Unknown, 0 Unchecked, 2.43ms Time], IncrementalHoareTripleChecker [0 Valid, 158 Invalid, 1 Unknown, 0 Unchecked, 2953.58ms Time] [2021-11-02 13:18:15,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-11-02 13:18:15,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2021-11-02 13:18:15,712 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-02 13:18:15,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 150 transitions. [2021-11-02 13:18:15,715 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 150 transitions. Word has length 30 [2021-11-02 13:18:15,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:18:15,716 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 150 transitions. [2021-11-02 13:18:15,716 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-02 13:18:15,716 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 150 transitions. [2021-11-02 13:18:15,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-11-02 13:18:15,717 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:18:15,717 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-02 13:18:15,718 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-02 13:18:15,718 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-02 13:18:15,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:18:15,719 INFO L85 PathProgramCache]: Analyzing trace with hash -649638665, now seen corresponding path program 1 times [2021-11-02 13:18:15,719 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:18:15,719 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190442629] [2021-11-02 13:18:15,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:18:15,720 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:18:15,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:18:16,087 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-02 13:18:16,087 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:18:16,087 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190442629] [2021-11-02 13:18:16,087 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190442629] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:18:16,087 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:18:16,088 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 13:18:16,088 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127140763] [2021-11-02 13:18:16,089 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 13:18:16,089 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:18:16,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 13:18:16,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-02 13:18:16,090 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-02 13:18:18,157 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-02 13:18:19,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:18:19,408 INFO L93 Difference]: Finished difference Result 213 states and 273 transitions. [2021-11-02 13:18:19,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 13:18:19,408 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-02 13:18:19,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:18:19,410 INFO L225 Difference]: With dead ends: 213 [2021-11-02 13:18:19,410 INFO L226 Difference]: Without dead ends: 117 [2021-11-02 13:18:19,411 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 35.02ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-02 13:18:19,411 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 134 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2911.58ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.91ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3264.36ms IncrementalHoareTripleChecker+Time [2021-11-02 13:18:19,412 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 0 Invalid, 225 Unknown, 0 Unchecked, 6.91ms Time], IncrementalHoareTripleChecker [7 Valid, 217 Invalid, 1 Unknown, 0 Unchecked, 3264.36ms Time] [2021-11-02 13:18:19,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-11-02 13:18:19,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2021-11-02 13:18:19,420 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-02 13:18:19,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 147 transitions. [2021-11-02 13:18:19,421 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 147 transitions. Word has length 32 [2021-11-02 13:18:19,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:18:19,422 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 147 transitions. [2021-11-02 13:18:19,422 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-02 13:18:19,422 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 147 transitions. [2021-11-02 13:18:19,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-02 13:18:19,423 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:18:19,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] [2021-11-02 13:18:19,423 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-02 13:18:19,424 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-02 13:18:19,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:18:19,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1150788759, now seen corresponding path program 1 times [2021-11-02 13:18:19,425 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:18:19,425 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223854025] [2021-11-02 13:18:19,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:18:19,425 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:18:19,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:18:19,901 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-02 13:18:19,902 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:18:19,902 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223854025] [2021-11-02 13:18:19,902 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223854025] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:18:19,903 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:18:19,903 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-02 13:18:19,903 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548978911] [2021-11-02 13:18:19,903 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-02 13:18:19,904 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:18:19,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-02 13:18:19,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-02 13:18:19,905 INFO L87 Difference]: Start difference. First operand 117 states and 147 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 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-02 13:18:21,967 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-02 13:18:23,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:18:23,373 INFO L93 Difference]: Finished difference Result 174 states and 217 transitions. [2021-11-02 13:18:23,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-02 13:18:23,373 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 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-02 13:18:23,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:18:23,375 INFO L225 Difference]: With dead ends: 174 [2021-11-02 13:18:23,375 INFO L226 Difference]: Without dead ends: 117 [2021-11-02 13:18:23,376 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 286.82ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-11-02 13:18:23,376 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 579 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 13 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2960.39ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 10.49ms SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3259.41ms IncrementalHoareTripleChecker+Time [2021-11-02 13:18:23,377 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [579 Valid, 0 Invalid, 262 Unknown, 0 Unchecked, 10.49ms Time], IncrementalHoareTripleChecker [13 Valid, 248 Invalid, 1 Unknown, 0 Unchecked, 3259.41ms Time] [2021-11-02 13:18:23,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-11-02 13:18:23,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2021-11-02 13:18:23,384 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-02 13:18:23,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 146 transitions. [2021-11-02 13:18:23,385 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 146 transitions. Word has length 36 [2021-11-02 13:18:23,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:18:23,386 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 146 transitions. [2021-11-02 13:18:23,386 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 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-02 13:18:23,386 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 146 transitions. [2021-11-02 13:18:23,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-02 13:18:23,387 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:18:23,388 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-02 13:18:23,388 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-02 13:18:23,388 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-02 13:18:23,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:18:23,389 INFO L85 PathProgramCache]: Analyzing trace with hash 410162962, now seen corresponding path program 1 times [2021-11-02 13:18:23,389 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:18:23,389 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665232364] [2021-11-02 13:18:23,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:18:23,390 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:18:23,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:18:24,132 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-02 13:18:24,132 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:18:24,132 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665232364] [2021-11-02 13:18:24,132 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665232364] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:18:24,132 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:18:24,133 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-02 13:18:24,133 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043939351] [2021-11-02 13:18:24,133 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-02 13:18:24,133 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:18:24,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-02 13:18:24,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-02 13:18:24,134 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-02 13:18:26,190 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-02 13:18:28,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:18:28,975 INFO L93 Difference]: Finished difference Result 216 states and 261 transitions. [2021-11-02 13:18:28,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-02 13:18:28,975 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-02 13:18:28,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:18:28,977 INFO L225 Difference]: With dead ends: 216 [2021-11-02 13:18:28,977 INFO L226 Difference]: Without dead ends: 208 [2021-11-02 13:18:28,978 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 309.44ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-11-02 13:18:28,979 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 176 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 51 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4192.60ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 11.01ms SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4613.75ms IncrementalHoareTripleChecker+Time [2021-11-02 13:18:28,979 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [176 Valid, 0 Invalid, 792 Unknown, 0 Unchecked, 11.01ms Time], IncrementalHoareTripleChecker [51 Valid, 740 Invalid, 1 Unknown, 0 Unchecked, 4613.75ms Time] [2021-11-02 13:18:28,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2021-11-02 13:18:28,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 133. [2021-11-02 13:18:28,989 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-02 13:18:28,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 162 transitions. [2021-11-02 13:18:28,991 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 162 transitions. Word has length 38 [2021-11-02 13:18:28,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:18:28,991 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 162 transitions. [2021-11-02 13:18:28,991 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-02 13:18:28,991 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 162 transitions. [2021-11-02 13:18:28,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-02 13:18:28,993 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:18:28,993 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-02 13:18:28,993 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-02 13:18:28,993 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-02 13:18:28,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:18:28,994 INFO L85 PathProgramCache]: Analyzing trace with hash -235054390, now seen corresponding path program 1 times [2021-11-02 13:18:28,994 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:18:28,994 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506978321] [2021-11-02 13:18:28,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:18:28,995 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:18:29,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:18:29,444 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-02 13:18:29,444 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:18:29,444 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506978321] [2021-11-02 13:18:29,444 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506978321] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:18:29,444 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:18:29,444 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-02 13:18:29,445 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480991148] [2021-11-02 13:18:29,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-02 13:18:29,445 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:18:29,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-02 13:18:29,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-02 13:18:29,446 INFO L87 Difference]: Start difference. First operand 133 states and 162 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 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-02 13:18:31,586 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-02 13:18:35,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:18:35,397 INFO L93 Difference]: Finished difference Result 394 states and 476 transitions. [2021-11-02 13:18:35,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-02 13:18:35,398 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 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-02 13:18:35,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:18:35,400 INFO L225 Difference]: With dead ends: 394 [2021-11-02 13:18:35,400 INFO L226 Difference]: Without dead ends: 293 [2021-11-02 13:18:35,401 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 587.17ms TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2021-11-02 13:18:35,402 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 458 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 995 mSolverCounterSat, 38 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5082.59ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 17.07ms SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 995 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5416.37ms IncrementalHoareTripleChecker+Time [2021-11-02 13:18:35,402 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [458 Valid, 0 Invalid, 1034 Unknown, 0 Unchecked, 17.07ms Time], IncrementalHoareTripleChecker [38 Valid, 995 Invalid, 1 Unknown, 0 Unchecked, 5416.37ms Time] [2021-11-02 13:18:35,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2021-11-02 13:18:35,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 207. [2021-11-02 13:18:35,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 202 states have (on average 1.2475247524752475) internal successors, (252), 206 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-02 13:18:35,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 252 transitions. [2021-11-02 13:18:35,417 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 252 transitions. Word has length 42 [2021-11-02 13:18:35,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:18:35,417 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 252 transitions. [2021-11-02 13:18:35,417 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 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-02 13:18:35,417 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 252 transitions. [2021-11-02 13:18:35,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-02 13:18:35,419 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:18:35,419 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-02 13:18:35,419 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-02 13:18:35,420 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-02 13:18:35,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:18:35,420 INFO L85 PathProgramCache]: Analyzing trace with hash 324843685, now seen corresponding path program 1 times [2021-11-02 13:18:35,420 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:18:35,421 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493137142] [2021-11-02 13:18:35,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:18:35,421 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:18:35,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:18:35,650 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-02 13:18:35,651 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:18:35,651 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493137142] [2021-11-02 13:18:35,651 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493137142] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:18:35,651 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:18:35,651 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 13:18:35,651 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805359820] [2021-11-02 13:18:35,652 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 13:18:35,652 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:18:35,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 13:18:35,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 13:18:35,652 INFO L87 Difference]: Start difference. First operand 207 states and 252 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-02 13:18:37,706 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-02 13:18:38,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:18:38,833 INFO L93 Difference]: Finished difference Result 264 states and 318 transitions. [2021-11-02 13:18:38,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-02 13:18:38,834 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-02 13:18:38,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:18:38,835 INFO L225 Difference]: With dead ends: 264 [2021-11-02 13:18:38,835 INFO L226 Difference]: Without dead ends: 207 [2021-11-02 13:18:38,836 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 54.92ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-02 13:18:38,836 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 102 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2903.65ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.06ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3130.66ms IncrementalHoareTripleChecker+Time [2021-11-02 13:18:38,837 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 0 Invalid, 319 Unknown, 0 Unchecked, 3.06ms Time], IncrementalHoareTripleChecker [5 Valid, 313 Invalid, 1 Unknown, 0 Unchecked, 3130.66ms Time] [2021-11-02 13:18:38,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2021-11-02 13:18:38,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2021-11-02 13:18:38,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 202 states have (on average 1.2376237623762376) internal successors, (250), 206 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-02 13:18:38,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 250 transitions. [2021-11-02 13:18:38,845 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 250 transitions. Word has length 43 [2021-11-02 13:18:38,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:18:38,846 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 250 transitions. [2021-11-02 13:18:38,846 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-02 13:18:38,846 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 250 transitions. [2021-11-02 13:18:38,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-02 13:18:38,848 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:18:38,848 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-02 13:18:38,848 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-02 13:18:38,848 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-02 13:18:38,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:18:38,849 INFO L85 PathProgramCache]: Analyzing trace with hash 495838041, now seen corresponding path program 1 times [2021-11-02 13:18:38,849 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:18:38,849 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296805093] [2021-11-02 13:18:38,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:18:38,850 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:18:38,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:18:39,065 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-02 13:18:39,066 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:18:39,066 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296805093] [2021-11-02 13:18:39,066 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296805093] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:18:39,066 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:18:39,066 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-02 13:18:39,067 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162261888] [2021-11-02 13:18:39,068 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-02 13:18:39,069 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:18:39,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-02 13:18:39,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 13:18:39,069 INFO L87 Difference]: Start difference. First operand 207 states and 250 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-02 13:18:41,130 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-02 13:18:42,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:18:42,015 INFO L93 Difference]: Finished difference Result 298 states and 362 transitions. [2021-11-02 13:18:42,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-02 13:18:42,016 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-02 13:18:42,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:18:42,020 INFO L225 Difference]: With dead ends: 298 [2021-11-02 13:18:42,020 INFO L226 Difference]: Without dead ends: 210 [2021-11-02 13:18:42,020 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.31ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-02 13:18:42,021 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2704.09ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.33ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2922.13ms IncrementalHoareTripleChecker+Time [2021-11-02 13:18:42,021 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 288 Unknown, 0 Unchecked, 1.33ms Time], IncrementalHoareTripleChecker [0 Valid, 287 Invalid, 1 Unknown, 0 Unchecked, 2922.13ms Time] [2021-11-02 13:18:42,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2021-11-02 13:18:42,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2021-11-02 13:18:42,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 205 states have (on average 1.2341463414634146) internal successors, (253), 209 states have internal predecessors, (253), 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-02 13:18:42,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 253 transitions. [2021-11-02 13:18:42,041 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 253 transitions. Word has length 45 [2021-11-02 13:18:42,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:18:42,041 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 253 transitions. [2021-11-02 13:18:42,041 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-02 13:18:42,041 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 253 transitions. [2021-11-02 13:18:42,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-02 13:18:42,043 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:18:42,043 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] [2021-11-02 13:18:42,043 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-02 13:18:42,043 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-02 13:18:42,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:18:42,044 INFO L85 PathProgramCache]: Analyzing trace with hash 959658833, now seen corresponding path program 1 times [2021-11-02 13:18:42,044 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:18:42,044 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022410803] [2021-11-02 13:18:42,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:18:42,045 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:18:42,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:18:42,422 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-02 13:18:42,422 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:18:42,422 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022410803] [2021-11-02 13:18:42,422 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022410803] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:18:42,422 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:18:42,423 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-02 13:18:42,423 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513159402] [2021-11-02 13:18:42,423 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-02 13:18:42,423 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:18:42,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-02 13:18:42,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-02 13:18:42,424 INFO L87 Difference]: Start difference. First operand 210 states and 253 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 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-02 13:18:44,482 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-02 13:18:46,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:18:46,626 INFO L93 Difference]: Finished difference Result 539 states and 644 transitions. [2021-11-02 13:18:46,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-02 13:18:46,627 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 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-02 13:18:46,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:18:46,629 INFO L225 Difference]: With dead ends: 539 [2021-11-02 13:18:46,629 INFO L226 Difference]: Without dead ends: 380 [2021-11-02 13:18:46,629 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 366.02ms TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2021-11-02 13:18:46,630 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 710 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 28 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3598.76ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 710 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.06ms SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3883.17ms IncrementalHoareTripleChecker+Time [2021-11-02 13:18:46,630 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [710 Valid, 0 Invalid, 557 Unknown, 0 Unchecked, 9.06ms Time], IncrementalHoareTripleChecker [28 Valid, 528 Invalid, 1 Unknown, 0 Unchecked, 3883.17ms Time] [2021-11-02 13:18:46,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2021-11-02 13:18:46,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 210. [2021-11-02 13:18:46,642 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-02 13:18:46,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 252 transitions. [2021-11-02 13:18:46,645 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 252 transitions. Word has length 45 [2021-11-02 13:18:46,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:18:46,646 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 252 transitions. [2021-11-02 13:18:46,646 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 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-02 13:18:46,646 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 252 transitions. [2021-11-02 13:18:46,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-02 13:18:46,654 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:18:46,654 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-02 13:18:46,655 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-02 13:18:46,655 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-02 13:18:46,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:18:46,656 INFO L85 PathProgramCache]: Analyzing trace with hash 2004884674, now seen corresponding path program 1 times [2021-11-02 13:18:46,656 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:18:46,656 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901841424] [2021-11-02 13:18:46,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:18:46,656 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:18:46,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:18:47,137 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-02 13:18:47,138 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:18:47,138 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901841424] [2021-11-02 13:18:47,138 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901841424] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:18:47,138 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:18:47,138 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-02 13:18:47,138 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644101173] [2021-11-02 13:18:47,139 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-02 13:18:47,139 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:18:47,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-02 13:18:47,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-02 13:18:47,140 INFO L87 Difference]: Start difference. First operand 210 states and 252 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 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-02 13:18:49,196 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-02 13:18:52,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:18:52,274 INFO L93 Difference]: Finished difference Result 426 states and 514 transitions. [2021-11-02 13:18:52,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-02 13:18:52,274 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 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-02 13:18:52,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:18:52,276 INFO L225 Difference]: With dead ends: 426 [2021-11-02 13:18:52,276 INFO L226 Difference]: Without dead ends: 286 [2021-11-02 13:18:52,276 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 475.28ms TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2021-11-02 13:18:52,277 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 356 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 989 mSolverCounterSat, 30 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4498.30ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.70ms SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 989 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4808.75ms IncrementalHoareTripleChecker+Time [2021-11-02 13:18:52,277 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [356 Valid, 0 Invalid, 1020 Unknown, 0 Unchecked, 8.70ms Time], IncrementalHoareTripleChecker [30 Valid, 989 Invalid, 1 Unknown, 0 Unchecked, 4808.75ms Time] [2021-11-02 13:18:52,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2021-11-02 13:18:52,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 257. [2021-11-02 13:18:52,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 252 states have (on average 1.2341269841269842) internal successors, (311), 256 states have internal predecessors, (311), 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-02 13:18:52,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 311 transitions. [2021-11-02 13:18:52,288 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 311 transitions. Word has length 46 [2021-11-02 13:18:52,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:18:52,288 INFO L470 AbstractCegarLoop]: Abstraction has 257 states and 311 transitions. [2021-11-02 13:18:52,288 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 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-02 13:18:52,288 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 311 transitions. [2021-11-02 13:18:52,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-11-02 13:18:52,289 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:18:52,289 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-02 13:18:52,289 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-02 13:18:52,290 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-02 13:18:52,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:18:52,290 INFO L85 PathProgramCache]: Analyzing trace with hash -954265451, now seen corresponding path program 1 times [2021-11-02 13:18:52,290 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:18:52,291 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291468428] [2021-11-02 13:18:52,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:18:52,291 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:18:52,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:18:52,694 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-02 13:18:52,694 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:18:52,694 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291468428] [2021-11-02 13:18:52,695 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291468428] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:18:52,695 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:18:52,695 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-02 13:18:52,695 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775202421] [2021-11-02 13:18:52,695 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-02 13:18:52,696 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:18:52,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-02 13:18:52,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-02 13:18:52,696 INFO L87 Difference]: Start difference. First operand 257 states and 311 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 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-02 13:18:54,753 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-02 13:18:57,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:18:57,405 INFO L93 Difference]: Finished difference Result 459 states and 546 transitions. [2021-11-02 13:18:57,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-02 13:18:57,406 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 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-02 13:18:57,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:18:57,407 INFO L225 Difference]: With dead ends: 459 [2021-11-02 13:18:57,407 INFO L226 Difference]: Without dead ends: 339 [2021-11-02 13:18:57,408 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 486.06ms TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2021-11-02 13:18:57,409 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 557 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 36 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4049.57ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.59ms SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4333.78ms IncrementalHoareTripleChecker+Time [2021-11-02 13:18:57,409 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [557 Valid, 0 Invalid, 828 Unknown, 0 Unchecked, 8.59ms Time], IncrementalHoareTripleChecker [36 Valid, 791 Invalid, 1 Unknown, 0 Unchecked, 4333.78ms Time] [2021-11-02 13:18:57,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2021-11-02 13:18:57,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 254. [2021-11-02 13:18:57,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 249 states have (on average 1.2289156626506024) internal successors, (306), 253 states have internal predecessors, (306), 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-02 13:18:57,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 306 transitions. [2021-11-02 13:18:57,420 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 306 transitions. Word has length 47 [2021-11-02 13:18:57,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:18:57,420 INFO L470 AbstractCegarLoop]: Abstraction has 254 states and 306 transitions. [2021-11-02 13:18:57,421 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 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-02 13:18:57,421 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 306 transitions. [2021-11-02 13:18:57,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-11-02 13:18:57,421 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:18:57,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] [2021-11-02 13:18:57,422 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-02 13:18:57,422 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 13:18:57,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:18:57,423 INFO L85 PathProgramCache]: Analyzing trace with hash 870337434, now seen corresponding path program 1 times [2021-11-02 13:18:57,423 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:18:57,423 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646332772] [2021-11-02 13:18:57,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:18:57,424 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:18:57,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:18:57,956 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-02 13:18:57,957 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:18:57,957 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646332772] [2021-11-02 13:18:57,957 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646332772] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:18:57,957 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:18:57,957 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-02 13:18:57,957 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245164988] [2021-11-02 13:18:57,957 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-02 13:18:57,958 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:18:57,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-02 13:18:57,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-11-02 13:18:57,958 INFO L87 Difference]: Start difference. First operand 254 states and 306 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 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-02 13:19:00,021 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-02 13:19:03,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:19:03,244 INFO L93 Difference]: Finished difference Result 372 states and 438 transitions. [2021-11-02 13:19:03,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-02 13:19:03,245 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 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-02 13:19:03,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:19:03,247 INFO L225 Difference]: With dead ends: 372 [2021-11-02 13:19:03,247 INFO L226 Difference]: Without dead ends: 327 [2021-11-02 13:19:03,248 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 820.85ms TimeCoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2021-11-02 13:19:03,248 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 575 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 934 mSolverCounterSat, 62 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4370.29ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.36ms SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 934 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4650.13ms IncrementalHoareTripleChecker+Time [2021-11-02 13:19:03,249 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [575 Valid, 0 Invalid, 997 Unknown, 0 Unchecked, 8.36ms Time], IncrementalHoareTripleChecker [62 Valid, 934 Invalid, 1 Unknown, 0 Unchecked, 4650.13ms Time] [2021-11-02 13:19:03,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2021-11-02 13:19:03,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 261. [2021-11-02 13:19:03,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 256 states have (on average 1.22265625) internal successors, (313), 260 states have internal predecessors, (313), 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-02 13:19:03,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 313 transitions. [2021-11-02 13:19:03,259 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 313 transitions. Word has length 49 [2021-11-02 13:19:03,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:19:03,260 INFO L470 AbstractCegarLoop]: Abstraction has 261 states and 313 transitions. [2021-11-02 13:19:03,260 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 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-02 13:19:03,260 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 313 transitions. [2021-11-02 13:19:03,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-11-02 13:19:03,261 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:19:03,261 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-02 13:19:03,261 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-02 13:19:03,262 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 13:19:03,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:19:03,262 INFO L85 PathProgramCache]: Analyzing trace with hash 77436505, now seen corresponding path program 1 times [2021-11-02 13:19:03,262 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:19:03,263 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85532365] [2021-11-02 13:19:03,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:19:03,263 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:19:03,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:19:03,706 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-02 13:19:03,707 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:19:03,707 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85532365] [2021-11-02 13:19:03,707 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85532365] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:19:03,707 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:19:03,707 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-02 13:19:03,707 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906999010] [2021-11-02 13:19:03,708 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-02 13:19:03,708 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:19:03,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-02 13:19:03,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-02 13:19:03,708 INFO L87 Difference]: Start difference. First operand 261 states and 313 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 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-02 13:19:04,901 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:19:06,193 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:19:07,532 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:19:08,865 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:19:11,092 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-02 13:19:13,208 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-02 13:19:15,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:19:15,586 INFO L93 Difference]: Finished difference Result 400 states and 476 transitions. [2021-11-02 13:19:15,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-02 13:19:15,586 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 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-02 13:19:15,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:19:15,588 INFO L225 Difference]: With dead ends: 400 [2021-11-02 13:19:15,588 INFO L226 Difference]: Without dead ends: 336 [2021-11-02 13:19:15,588 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 355.00ms TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-11-02 13:19:15,588 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 230 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 22 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10367.14ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.21ms SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11657.47ms IncrementalHoareTripleChecker+Time [2021-11-02 13:19:15,589 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [230 Valid, 0 Invalid, 788 Unknown, 0 Unchecked, 5.21ms Time], IncrementalHoareTripleChecker [22 Valid, 764 Invalid, 2 Unknown, 0 Unchecked, 11657.47ms Time] [2021-11-02 13:19:15,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2021-11-02 13:19:15,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 251. [2021-11-02 13:19:15,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 246 states have (on average 1.2113821138211383) internal successors, (298), 250 states have internal predecessors, (298), 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-02 13:19:15,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 298 transitions. [2021-11-02 13:19:15,599 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 298 transitions. Word has length 49 [2021-11-02 13:19:15,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:19:15,600 INFO L470 AbstractCegarLoop]: Abstraction has 251 states and 298 transitions. [2021-11-02 13:19:15,600 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 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-02 13:19:15,600 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 298 transitions. [2021-11-02 13:19:15,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-11-02 13:19:15,601 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:19:15,601 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] [2021-11-02 13:19:15,601 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-02 13:19:15,602 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 13:19:15,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:19:15,602 INFO L85 PathProgramCache]: Analyzing trace with hash -320354742, now seen corresponding path program 1 times [2021-11-02 13:19:15,602 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:19:15,603 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775240115] [2021-11-02 13:19:15,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:19:15,603 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:19:15,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:19:16,312 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-02 13:19:16,312 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:19:16,312 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775240115] [2021-11-02 13:19:16,313 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775240115] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:19:16,313 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:19:16,313 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-02 13:19:16,313 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242789815] [2021-11-02 13:19:16,314 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-02 13:19:16,314 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:19:16,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-02 13:19:16,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-11-02 13:19:16,315 INFO L87 Difference]: Start difference. First operand 251 states and 298 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 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-02 13:19:18,365 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-02 13:19:24,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:19:24,351 INFO L93 Difference]: Finished difference Result 540 states and 644 transitions. [2021-11-02 13:19:24,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-02 13:19:24,352 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 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 50 [2021-11-02 13:19:24,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:19:24,353 INFO L225 Difference]: With dead ends: 540 [2021-11-02 13:19:24,353 INFO L226 Difference]: Without dead ends: 460 [2021-11-02 13:19:24,354 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 948.01ms TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2021-11-02 13:19:24,354 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 545 mSDsluCounter, 992 mSDsCounter, 0 mSdLazyCounter, 1702 mSolverCounterSat, 22 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6896.50ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 15.09ms SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1702 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7272.05ms IncrementalHoareTripleChecker+Time [2021-11-02 13:19:24,354 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [545 Valid, 0 Invalid, 1725 Unknown, 0 Unchecked, 15.09ms Time], IncrementalHoareTripleChecker [22 Valid, 1702 Invalid, 1 Unknown, 0 Unchecked, 7272.05ms Time] [2021-11-02 13:19:24,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2021-11-02 13:19:24,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 280. [2021-11-02 13:19:24,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 275 states have (on average 1.210909090909091) internal successors, (333), 279 states have internal predecessors, (333), 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-02 13:19:24,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 333 transitions. [2021-11-02 13:19:24,366 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 333 transitions. Word has length 50 [2021-11-02 13:19:24,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:19:24,366 INFO L470 AbstractCegarLoop]: Abstraction has 280 states and 333 transitions. [2021-11-02 13:19:24,367 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 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-02 13:19:24,367 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 333 transitions. [2021-11-02 13:19:24,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-11-02 13:19:24,367 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:19:24,368 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] [2021-11-02 13:19:24,368 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-02 13:19:24,368 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-02 13:19:24,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:19:24,369 INFO L85 PathProgramCache]: Analyzing trace with hash 2129245388, now seen corresponding path program 1 times [2021-11-02 13:19:24,369 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:19:24,369 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802367792] [2021-11-02 13:19:24,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:19:24,369 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:19:24,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:19:24,857 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-02 13:19:24,857 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:19:24,858 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802367792] [2021-11-02 13:19:24,858 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802367792] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:19:24,858 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:19:24,858 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-02 13:19:24,858 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246547515] [2021-11-02 13:19:24,858 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-02 13:19:24,858 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:19:24,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-02 13:19:24,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-11-02 13:19:24,859 INFO L87 Difference]: Start difference. First operand 280 states and 333 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 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-02 13:19:27,434 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.57s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:19:30,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:19:30,907 INFO L93 Difference]: Finished difference Result 828 states and 1004 transitions. [2021-11-02 13:19:30,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-02 13:19:30,907 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 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 50 [2021-11-02 13:19:30,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:19:30,909 INFO L225 Difference]: With dead ends: 828 [2021-11-02 13:19:30,909 INFO L226 Difference]: Without dead ends: 635 [2021-11-02 13:19:30,910 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 476.96ms TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2021-11-02 13:19:30,911 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 739 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 1205 mSolverCounterSat, 39 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5346.16ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 739 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.21ms SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1205 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5677.15ms IncrementalHoareTripleChecker+Time [2021-11-02 13:19:30,911 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [739 Valid, 0 Invalid, 1245 Unknown, 0 Unchecked, 9.21ms Time], IncrementalHoareTripleChecker [39 Valid, 1205 Invalid, 1 Unknown, 0 Unchecked, 5677.15ms Time] [2021-11-02 13:19:30,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2021-11-02 13:19:30,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 396. [2021-11-02 13:19:30,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 391 states have (on average 1.2199488491048593) internal successors, (477), 395 states have internal predecessors, (477), 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-02 13:19:30,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 477 transitions. [2021-11-02 13:19:30,939 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 477 transitions. Word has length 50 [2021-11-02 13:19:30,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:19:30,940 INFO L470 AbstractCegarLoop]: Abstraction has 396 states and 477 transitions. [2021-11-02 13:19:30,940 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 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-02 13:19:30,940 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 477 transitions. [2021-11-02 13:19:30,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-11-02 13:19:30,941 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:19:30,941 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] [2021-11-02 13:19:30,941 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-02 13:19:30,942 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 13:19:30,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:19:30,942 INFO L85 PathProgramCache]: Analyzing trace with hash -2103682294, now seen corresponding path program 1 times [2021-11-02 13:19:30,942 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:19:30,942 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033826684] [2021-11-02 13:19:30,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:19:30,943 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:19:31,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:19:31,457 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-02 13:19:31,458 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:19:31,458 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033826684] [2021-11-02 13:19:31,458 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033826684] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:19:31,458 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:19:31,458 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-02 13:19:31,458 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885773597] [2021-11-02 13:19:31,458 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-02 13:19:31,458 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:19:31,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-02 13:19:31,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-11-02 13:19:31,459 INFO L87 Difference]: Start difference. First operand 396 states and 477 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 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-02 13:19:33,512 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-02 13:19:38,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:19:38,898 INFO L93 Difference]: Finished difference Result 836 states and 1007 transitions. [2021-11-02 13:19:38,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-02 13:19:38,899 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 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 50 [2021-11-02 13:19:38,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:19:38,901 INFO L225 Difference]: With dead ends: 836 [2021-11-02 13:19:38,901 INFO L226 Difference]: Without dead ends: 731 [2021-11-02 13:19:38,901 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 928.17ms TimeCoverageRelationStatistics Valid=197, Invalid=453, Unknown=0, NotChecked=0, Total=650 [2021-11-02 13:19:38,902 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 753 mSDsluCounter, 1003 mSDsCounter, 0 mSdLazyCounter, 1779 mSolverCounterSat, 35 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6312.22ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 753 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 13.07ms SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1779 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6611.09ms IncrementalHoareTripleChecker+Time [2021-11-02 13:19:38,902 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [753 Valid, 0 Invalid, 1815 Unknown, 0 Unchecked, 13.07ms Time], IncrementalHoareTripleChecker [35 Valid, 1779 Invalid, 1 Unknown, 0 Unchecked, 6611.09ms Time] [2021-11-02 13:19:38,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2021-11-02 13:19:38,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 428. [2021-11-02 13:19:38,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 423 states have (on average 1.2222222222222223) internal successors, (517), 427 states have internal predecessors, (517), 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-02 13:19:38,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 517 transitions. [2021-11-02 13:19:38,920 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 517 transitions. Word has length 50 [2021-11-02 13:19:38,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:19:38,920 INFO L470 AbstractCegarLoop]: Abstraction has 428 states and 517 transitions. [2021-11-02 13:19:38,921 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 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-02 13:19:38,921 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 517 transitions. [2021-11-02 13:19:38,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-11-02 13:19:38,922 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:19:38,922 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] [2021-11-02 13:19:38,922 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-02 13:19:38,922 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-02 13:19:38,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:19:38,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1423623924, now seen corresponding path program 1 times [2021-11-02 13:19:38,923 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:19:38,923 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601398006] [2021-11-02 13:19:38,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:19:38,924 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:19:39,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:19:39,493 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-02 13:19:39,494 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:19:39,494 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601398006] [2021-11-02 13:19:39,494 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601398006] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:19:39,494 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:19:39,494 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-02 13:19:39,494 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160021999] [2021-11-02 13:19:39,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-02 13:19:39,495 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:19:39,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-02 13:19:39,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-02 13:19:39,495 INFO L87 Difference]: Start difference. First operand 428 states and 517 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 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-02 13:19:41,553 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-02 13:19:44,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:19:44,564 INFO L93 Difference]: Finished difference Result 914 states and 1091 transitions. [2021-11-02 13:19:44,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-02 13:19:44,565 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 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 50 [2021-11-02 13:19:44,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:19:44,566 INFO L225 Difference]: With dead ends: 914 [2021-11-02 13:19:44,566 INFO L226 Difference]: Without dead ends: 513 [2021-11-02 13:19:44,567 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 256.35ms TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-02 13:19:44,568 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 84 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 912 mSolverCounterSat, 35 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4537.16ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.42ms SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 912 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4910.08ms IncrementalHoareTripleChecker+Time [2021-11-02 13:19:44,568 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 0 Invalid, 948 Unknown, 0 Unchecked, 6.42ms Time], IncrementalHoareTripleChecker [35 Valid, 912 Invalid, 1 Unknown, 0 Unchecked, 4910.08ms Time] [2021-11-02 13:19:44,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2021-11-02 13:19:44,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 428. [2021-11-02 13:19:44,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 423 states have (on average 1.2056737588652482) internal successors, (510), 427 states have internal predecessors, (510), 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-02 13:19:44,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 510 transitions. [2021-11-02 13:19:44,584 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 510 transitions. Word has length 50 [2021-11-02 13:19:44,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:19:44,584 INFO L470 AbstractCegarLoop]: Abstraction has 428 states and 510 transitions. [2021-11-02 13:19:44,584 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 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-02 13:19:44,585 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 510 transitions. [2021-11-02 13:19:44,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-02 13:19:44,585 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:19:44,586 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-02 13:19:44,586 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-02 13:19:44,586 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 13:19:44,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:19:44,587 INFO L85 PathProgramCache]: Analyzing trace with hash -905295060, now seen corresponding path program 1 times [2021-11-02 13:19:44,587 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:19:44,587 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916707958] [2021-11-02 13:19:44,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:19:44,587 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:19:44,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:19:44,798 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-02 13:19:44,798 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:19:44,798 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916707958] [2021-11-02 13:19:44,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916707958] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:19:44,798 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:19:44,798 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 13:19:44,799 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368278309] [2021-11-02 13:19:44,799 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 13:19:44,799 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:19:44,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 13:19:44,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 13:19:44,799 INFO L87 Difference]: Start difference. First operand 428 states and 510 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 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-02 13:19:48,272 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.47s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:19:49,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:19:49,696 INFO L93 Difference]: Finished difference Result 596 states and 707 transitions. [2021-11-02 13:19:49,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-02 13:19:49,697 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 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-02 13:19:49,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:19:49,698 INFO L225 Difference]: With dead ends: 596 [2021-11-02 13:19:49,698 INFO L226 Difference]: Without dead ends: 322 [2021-11-02 13:19:49,699 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 50.76ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-02 13:19:49,699 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 32 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 19 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4428.06ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.89ms SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4855.74ms IncrementalHoareTripleChecker+Time [2021-11-02 13:19:49,699 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 0 Invalid, 472 Unknown, 0 Unchecked, 1.89ms Time], IncrementalHoareTripleChecker [19 Valid, 452 Invalid, 1 Unknown, 0 Unchecked, 4855.74ms Time] [2021-11-02 13:19:49,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2021-11-02 13:19:49,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 280. [2021-11-02 13:19:49,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 275 states have (on average 1.1781818181818182) internal successors, (324), 279 states have internal predecessors, (324), 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-02 13:19:49,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 324 transitions. [2021-11-02 13:19:49,709 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 324 transitions. Word has length 54 [2021-11-02 13:19:49,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:19:49,709 INFO L470 AbstractCegarLoop]: Abstraction has 280 states and 324 transitions. [2021-11-02 13:19:49,710 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 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-02 13:19:49,710 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 324 transitions. [2021-11-02 13:19:49,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-11-02 13:19:49,711 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:19:49,711 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-02 13:19:49,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-02 13:19:49,711 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-02 13:19:49,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:19:49,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1686129362, now seen corresponding path program 1 times [2021-11-02 13:19:49,712 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:19:49,712 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146932653] [2021-11-02 13:19:49,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:19:49,712 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:19:49,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:19:49,934 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-02 13:19:49,934 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:19:49,935 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146932653] [2021-11-02 13:19:49,935 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146932653] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:19:49,935 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:19:49,935 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-02 13:19:49,935 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15899299] [2021-11-02 13:19:49,935 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-02 13:19:49,935 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:19:49,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-02 13:19:49,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-02 13:19:49,936 INFO L87 Difference]: Start difference. First operand 280 states and 324 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 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-02 13:19:52,822 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.88s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:19:54,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:19:54,919 INFO L93 Difference]: Finished difference Result 533 states and 617 transitions. [2021-11-02 13:19:54,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-02 13:19:54,919 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 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-02 13:19:54,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:19:54,920 INFO L225 Difference]: With dead ends: 533 [2021-11-02 13:19:54,920 INFO L226 Difference]: Without dead ends: 300 [2021-11-02 13:19:54,921 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 88.25ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-02 13:19:54,921 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 101 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 26 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4442.89ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.88ms SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4919.90ms IncrementalHoareTripleChecker+Time [2021-11-02 13:19:54,921 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 0 Invalid, 539 Unknown, 0 Unchecked, 3.88ms Time], IncrementalHoareTripleChecker [26 Valid, 512 Invalid, 1 Unknown, 0 Unchecked, 4919.90ms Time] [2021-11-02 13:19:54,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2021-11-02 13:19:54,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 280. [2021-11-02 13:19:54,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 275 states have (on average 1.1418181818181818) internal successors, (314), 279 states have internal predecessors, (314), 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-02 13:19:54,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 314 transitions. [2021-11-02 13:19:54,932 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 314 transitions. Word has length 56 [2021-11-02 13:19:54,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:19:54,932 INFO L470 AbstractCegarLoop]: Abstraction has 280 states and 314 transitions. [2021-11-02 13:19:54,932 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 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-02 13:19:54,933 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 314 transitions. [2021-11-02 13:19:54,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-11-02 13:19:54,933 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:19:54,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] [2021-11-02 13:19:54,934 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-02 13:19:54,934 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-02 13:19:54,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:19:54,935 INFO L85 PathProgramCache]: Analyzing trace with hash 485245166, now seen corresponding path program 1 times [2021-11-02 13:19:54,935 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:19:54,935 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520183584] [2021-11-02 13:19:54,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:19:54,936 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:19:57,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:19:57,779 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-02 13:19:57,779 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:19:57,779 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520183584] [2021-11-02 13:19:57,779 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520183584] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:19:57,779 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:19:57,779 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-02 13:19:57,779 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635394733] [2021-11-02 13:19:57,780 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-02 13:19:57,780 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:19:57,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-02 13:19:57,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-11-02 13:19:57,781 INFO L87 Difference]: Start difference. First operand 280 states and 314 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-02 13:19:59,845 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-02 13:20:02,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:20:02,945 INFO L93 Difference]: Finished difference Result 589 states and 659 transitions. [2021-11-02 13:20:02,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-02 13:20:02,945 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-02 13:20:02,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:20:02,947 INFO L225 Difference]: With dead ends: 589 [2021-11-02 13:20:02,947 INFO L226 Difference]: Without dead ends: 352 [2021-11-02 13:20:02,947 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 650.11ms TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2021-11-02 13:20:02,948 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 470 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 806 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4359.43ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.47ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 806 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4827.35ms IncrementalHoareTripleChecker+Time [2021-11-02 13:20:02,948 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [470 Valid, 0 Invalid, 813 Unknown, 0 Unchecked, 8.47ms Time], IncrementalHoareTripleChecker [6 Valid, 806 Invalid, 1 Unknown, 0 Unchecked, 4827.35ms Time] [2021-11-02 13:20:02,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2021-11-02 13:20:02,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 284. [2021-11-02 13:20:02,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 279 states have (on average 1.1397849462365592) internal successors, (318), 283 states have internal predecessors, (318), 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-02 13:20:02,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 318 transitions. [2021-11-02 13:20:02,958 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 318 transitions. Word has length 56 [2021-11-02 13:20:02,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:20:02,959 INFO L470 AbstractCegarLoop]: Abstraction has 284 states and 318 transitions. [2021-11-02 13:20:02,959 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-02 13:20:02,959 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 318 transitions. [2021-11-02 13:20:02,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-11-02 13:20:02,960 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:20:02,960 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-02 13:20:02,960 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-02 13:20:02,961 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 13:20:02,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:20:02,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1309942923, now seen corresponding path program 1 times [2021-11-02 13:20:02,961 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:20:02,961 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910723243] [2021-11-02 13:20:02,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:20:02,962 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:20:03,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:20:03,197 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-02 13:20:03,197 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:20:03,197 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910723243] [2021-11-02 13:20:03,197 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910723243] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:20:03,197 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:20:03,197 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 13:20:03,197 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701926825] [2021-11-02 13:20:03,198 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 13:20:03,198 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:20:03,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 13:20:03,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 13:20:03,198 INFO L87 Difference]: Start difference. First operand 284 states and 318 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-02 13:20:06,305 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:20:07,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:20:07,459 INFO L93 Difference]: Finished difference Result 295 states and 328 transitions. [2021-11-02 13:20:07,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-02 13:20:07,460 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-02 13:20:07,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:20:07,461 INFO L225 Difference]: With dead ends: 295 [2021-11-02 13:20:07,461 INFO L226 Difference]: Without dead ends: 284 [2021-11-02 13:20:07,461 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 53.96ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-02 13:20:07,461 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 124 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3797.90ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.72ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4216.64ms IncrementalHoareTripleChecker+Time [2021-11-02 13:20:07,462 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 0 Invalid, 240 Unknown, 0 Unchecked, 1.72ms Time], IncrementalHoareTripleChecker [5 Valid, 234 Invalid, 1 Unknown, 0 Unchecked, 4216.64ms Time] [2021-11-02 13:20:07,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2021-11-02 13:20:07,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 284. [2021-11-02 13:20:07,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 279 states have (on average 1.136200716845878) internal successors, (317), 283 states have internal predecessors, (317), 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-02 13:20:07,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 317 transitions. [2021-11-02 13:20:07,472 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 317 transitions. Word has length 58 [2021-11-02 13:20:07,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:20:07,472 INFO L470 AbstractCegarLoop]: Abstraction has 284 states and 317 transitions. [2021-11-02 13:20:07,472 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-02 13:20:07,472 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 317 transitions. [2021-11-02 13:20:07,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-11-02 13:20:07,473 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:20:07,473 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-02 13:20:07,474 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-02 13:20:07,474 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 13:20:07,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:20:07,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1050364765, now seen corresponding path program 1 times [2021-11-02 13:20:07,475 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:20:07,475 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354015771] [2021-11-02 13:20:07,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:20:07,475 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:20:10,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:20:11,646 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-02 13:20:11,646 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:20:11,646 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354015771] [2021-11-02 13:20:11,646 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354015771] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:20:11,646 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:20:11,646 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-02 13:20:11,647 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329964009] [2021-11-02 13:20:11,647 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-02 13:20:11,647 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:20:11,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-02 13:20:11,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2021-11-02 13:20:11,648 INFO L87 Difference]: Start difference. First operand 284 states and 317 transitions. Second operand has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 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-02 13:20:13,758 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-02 13:20:20,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:20:20,849 INFO L93 Difference]: Finished difference Result 533 states and 592 transitions. [2021-11-02 13:20:20,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-02 13:20:20,849 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 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-02 13:20:20,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:20:20,850 INFO L225 Difference]: With dead ends: 533 [2021-11-02 13:20:20,850 INFO L226 Difference]: Without dead ends: 373 [2021-11-02 13:20:20,851 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 2051.45ms TimeCoverageRelationStatistics Valid=194, Invalid=508, Unknown=0, NotChecked=0, Total=702 [2021-11-02 13:20:20,851 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 673 mSDsluCounter, 1320 mSDsCounter, 0 mSdLazyCounter, 2317 mSolverCounterSat, 18 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7463.64ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 673 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 16.34ms SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 2317 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7949.98ms IncrementalHoareTripleChecker+Time [2021-11-02 13:20:20,852 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [673 Valid, 0 Invalid, 2336 Unknown, 0 Unchecked, 16.34ms Time], IncrementalHoareTripleChecker [18 Valid, 2317 Invalid, 1 Unknown, 0 Unchecked, 7949.98ms Time] [2021-11-02 13:20:20,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2021-11-02 13:20:20,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 266. [2021-11-02 13:20:20,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 261 states have (on average 1.1417624521072798) internal successors, (298), 265 states have internal predecessors, (298), 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-02 13:20:20,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 298 transitions. [2021-11-02 13:20:20,862 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 298 transitions. Word has length 59 [2021-11-02 13:20:20,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:20:20,862 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 298 transitions. [2021-11-02 13:20:20,862 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 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-02 13:20:20,863 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 298 transitions. [2021-11-02 13:20:20,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-11-02 13:20:20,863 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:20:20,864 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] [2021-11-02 13:20:20,864 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-02 13:20:20,864 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-02 13:20:20,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:20:20,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1024189396, now seen corresponding path program 1 times [2021-11-02 13:20:20,865 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:20:20,865 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600123697] [2021-11-02 13:20:20,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:20:20,865 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:20:21,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:20:21,332 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-02 13:20:21,332 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:20:21,332 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600123697] [2021-11-02 13:20:21,332 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600123697] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:20:21,332 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:20:21,332 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-02 13:20:21,332 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700857582] [2021-11-02 13:20:21,333 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-02 13:20:21,333 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:20:21,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-02 13:20:21,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-02 13:20:21,333 INFO L87 Difference]: Start difference. First operand 266 states and 298 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 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-02 13:20:23,588 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:20:25,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:20:25,334 INFO L93 Difference]: Finished difference Result 488 states and 548 transitions. [2021-11-02 13:20:25,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-02 13:20:25,334 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 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-02 13:20:25,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:20:25,335 INFO L225 Difference]: With dead ends: 488 [2021-11-02 13:20:25,335 INFO L226 Difference]: Without dead ends: 358 [2021-11-02 13:20:25,336 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 317.40ms TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-11-02 13:20:25,336 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 312 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 21 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3474.50ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.50ms SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3815.54ms IncrementalHoareTripleChecker+Time [2021-11-02 13:20:25,336 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [312 Valid, 0 Invalid, 537 Unknown, 0 Unchecked, 3.50ms Time], IncrementalHoareTripleChecker [21 Valid, 515 Invalid, 1 Unknown, 0 Unchecked, 3815.54ms Time] [2021-11-02 13:20:25,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2021-11-02 13:20:25,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 263. [2021-11-02 13:20:25,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 258 states have (on average 1.1356589147286822) internal successors, (293), 262 states have internal predecessors, (293), 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-02 13:20:25,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 293 transitions. [2021-11-02 13:20:25,346 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 293 transitions. Word has length 59 [2021-11-02 13:20:25,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:20:25,346 INFO L470 AbstractCegarLoop]: Abstraction has 263 states and 293 transitions. [2021-11-02 13:20:25,346 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 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-02 13:20:25,346 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 293 transitions. [2021-11-02 13:20:25,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-11-02 13:20:25,347 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:20:25,347 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] [2021-11-02 13:20:25,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-02 13:20:25,348 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-02 13:20:25,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:20:25,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1792584358, now seen corresponding path program 1 times [2021-11-02 13:20:25,348 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:20:25,349 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610143927] [2021-11-02 13:20:25,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:20:25,349 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:20:25,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:20:25,854 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-02 13:20:25,854 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:20:25,854 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610143927] [2021-11-02 13:20:25,854 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610143927] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:20:25,854 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:20:25,854 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-02 13:20:25,854 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872963609] [2021-11-02 13:20:25,855 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-02 13:20:25,855 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:20:25,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-02 13:20:25,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-02 13:20:25,855 INFO L87 Difference]: Start difference. First operand 263 states and 293 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 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-02 13:20:28,741 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.88s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:20:31,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:20:31,312 INFO L93 Difference]: Finished difference Result 431 states and 477 transitions. [2021-11-02 13:20:31,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-02 13:20:31,312 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 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 60 [2021-11-02 13:20:31,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:20:31,313 INFO L225 Difference]: With dead ends: 431 [2021-11-02 13:20:31,313 INFO L226 Difference]: Without dead ends: 343 [2021-11-02 13:20:31,314 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 308.34ms TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2021-11-02 13:20:31,314 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 263 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 877 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4829.42ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.66ms SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 877 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5301.07ms IncrementalHoareTripleChecker+Time [2021-11-02 13:20:31,315 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [263 Valid, 0 Invalid, 894 Unknown, 0 Unchecked, 4.66ms Time], IncrementalHoareTripleChecker [16 Valid, 877 Invalid, 1 Unknown, 0 Unchecked, 5301.07ms Time] [2021-11-02 13:20:31,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2021-11-02 13:20:31,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 262. [2021-11-02 13:20:31,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 257 states have (on average 1.132295719844358) internal successors, (291), 261 states have internal predecessors, (291), 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-02 13:20:31,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 291 transitions. [2021-11-02 13:20:31,324 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 291 transitions. Word has length 60 [2021-11-02 13:20:31,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:20:31,324 INFO L470 AbstractCegarLoop]: Abstraction has 262 states and 291 transitions. [2021-11-02 13:20:31,325 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 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-02 13:20:31,325 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 291 transitions. [2021-11-02 13:20:31,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-11-02 13:20:31,326 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:20:31,326 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] [2021-11-02 13:20:31,326 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-02 13:20:31,326 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-02 13:20:31,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:20:31,327 INFO L85 PathProgramCache]: Analyzing trace with hash -505066727, now seen corresponding path program 1 times [2021-11-02 13:20:31,327 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:20:31,327 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712716810] [2021-11-02 13:20:31,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:20:31,327 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:20:31,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:20:31,721 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-02 13:20:31,721 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:20:31,722 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712716810] [2021-11-02 13:20:31,722 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712716810] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:20:31,722 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:20:31,722 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-02 13:20:31,722 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081863218] [2021-11-02 13:20:31,722 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-02 13:20:31,722 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:20:31,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-02 13:20:31,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-02 13:20:31,723 INFO L87 Difference]: Start difference. First operand 262 states and 291 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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-02 13:20:34,561 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.84s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:20:37,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:20:37,196 INFO L93 Difference]: Finished difference Result 392 states and 434 transitions. [2021-11-02 13:20:37,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-02 13:20:37,196 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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 61 [2021-11-02 13:20:37,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:20:37,197 INFO L225 Difference]: With dead ends: 392 [2021-11-02 13:20:37,197 INFO L226 Difference]: Without dead ends: 343 [2021-11-02 13:20:37,198 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 529.41ms TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2021-11-02 13:20:37,198 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 237 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 831 mSolverCounterSat, 28 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4624.38ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.55ms SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 831 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5080.75ms IncrementalHoareTripleChecker+Time [2021-11-02 13:20:37,199 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [237 Valid, 0 Invalid, 860 Unknown, 0 Unchecked, 4.55ms Time], IncrementalHoareTripleChecker [28 Valid, 831 Invalid, 1 Unknown, 0 Unchecked, 5080.75ms Time] [2021-11-02 13:20:37,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2021-11-02 13:20:37,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 230. [2021-11-02 13:20:37,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 225 states have (on average 1.1333333333333333) internal successors, (255), 229 states have internal predecessors, (255), 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-02 13:20:37,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 255 transitions. [2021-11-02 13:20:37,208 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 255 transitions. Word has length 61 [2021-11-02 13:20:37,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:20:37,208 INFO L470 AbstractCegarLoop]: Abstraction has 230 states and 255 transitions. [2021-11-02 13:20:37,208 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 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-02 13:20:37,208 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 255 transitions. [2021-11-02 13:20:37,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-02 13:20:37,209 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:20:37,209 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-02 13:20:37,209 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-02 13:20:37,210 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 13:20:37,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:20:37,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1944530334, now seen corresponding path program 1 times [2021-11-02 13:20:37,210 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:20:37,210 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627583700] [2021-11-02 13:20:37,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:20:37,211 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:20:39,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:20:40,747 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-02 13:20:40,747 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:20:40,748 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627583700] [2021-11-02 13:20:40,748 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627583700] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:20:40,748 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:20:40,748 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-02 13:20:40,748 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978441934] [2021-11-02 13:20:40,748 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-02 13:20:40,748 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:20:40,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-02 13:20:40,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-11-02 13:20:40,749 INFO L87 Difference]: Start difference. First operand 230 states and 255 transitions. Second operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 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-02 13:20:43,637 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.89s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:20:49,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:20:49,452 INFO L93 Difference]: Finished difference Result 395 states and 429 transitions. [2021-11-02 13:20:49,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-02 13:20:49,453 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 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-02 13:20:49,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:20:49,454 INFO L225 Difference]: With dead ends: 395 [2021-11-02 13:20:49,454 INFO L226 Difference]: Without dead ends: 322 [2021-11-02 13:20:49,455 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 1984.60ms TimeCoverageRelationStatistics Valid=245, Invalid=747, Unknown=0, NotChecked=0, Total=992 [2021-11-02 13:20:49,456 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 707 mSDsluCounter, 1057 mSDsCounter, 0 mSdLazyCounter, 1735 mSolverCounterSat, 60 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6693.21ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 707 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 11.85ms SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1735 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7254.78ms IncrementalHoareTripleChecker+Time [2021-11-02 13:20:49,456 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [707 Valid, 0 Invalid, 1796 Unknown, 0 Unchecked, 11.85ms Time], IncrementalHoareTripleChecker [60 Valid, 1735 Invalid, 1 Unknown, 0 Unchecked, 7254.78ms Time] [2021-11-02 13:20:49,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2021-11-02 13:20:49,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 233. [2021-11-02 13:20:49,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 228 states have (on average 1.131578947368421) internal successors, (258), 232 states have internal predecessors, (258), 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-02 13:20:49,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 258 transitions. [2021-11-02 13:20:49,466 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 258 transitions. Word has length 62 [2021-11-02 13:20:49,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:20:49,467 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 258 transitions. [2021-11-02 13:20:49,467 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 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-02 13:20:49,467 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 258 transitions. [2021-11-02 13:20:49,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-02 13:20:49,468 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:20:49,468 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-02 13:20:49,468 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-02 13:20:49,468 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 13:20:49,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:20:49,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1670378592, now seen corresponding path program 1 times [2021-11-02 13:20:49,469 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:20:49,469 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226575408] [2021-11-02 13:20:49,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:20:49,470 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:20:49,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:20:49,803 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-02 13:20:49,804 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:20:49,804 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226575408] [2021-11-02 13:20:49,804 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226575408] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:20:49,804 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:20:49,804 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-02 13:20:49,804 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920837248] [2021-11-02 13:20:49,804 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-02 13:20:49,804 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:20:49,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-02 13:20:49,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-02 13:20:49,805 INFO L87 Difference]: Start difference. First operand 233 states and 258 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 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-02 13:20:52,638 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.83s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:20:55,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:20:55,035 INFO L93 Difference]: Finished difference Result 346 states and 377 transitions. [2021-11-02 13:20:55,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-02 13:20:55,036 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 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-02 13:20:55,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:20:55,036 INFO L225 Difference]: With dead ends: 346 [2021-11-02 13:20:55,036 INFO L226 Difference]: Without dead ends: 271 [2021-11-02 13:20:55,037 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 250.80ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-11-02 13:20:55,037 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 207 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 815 mSolverCounterSat, 20 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4608.48ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.59ms SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 815 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5063.02ms IncrementalHoareTripleChecker+Time [2021-11-02 13:20:55,037 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [207 Valid, 0 Invalid, 836 Unknown, 0 Unchecked, 4.59ms Time], IncrementalHoareTripleChecker [20 Valid, 815 Invalid, 1 Unknown, 0 Unchecked, 5063.02ms Time] [2021-11-02 13:20:55,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2021-11-02 13:20:55,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 229. [2021-11-02 13:20:55,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 224 states have (on average 1.125) internal successors, (252), 228 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-02 13:20:55,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 252 transitions. [2021-11-02 13:20:55,047 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 252 transitions. Word has length 62 [2021-11-02 13:20:55,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:20:55,047 INFO L470 AbstractCegarLoop]: Abstraction has 229 states and 252 transitions. [2021-11-02 13:20:55,047 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 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-02 13:20:55,047 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 252 transitions. [2021-11-02 13:20:55,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-02 13:20:55,048 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:20:55,048 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-02 13:20:55,048 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-02 13:20:55,049 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 13:20:55,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:20:55,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1831062709, now seen corresponding path program 1 times [2021-11-02 13:20:55,049 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:20:55,049 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057908327] [2021-11-02 13:20:55,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:20:55,050 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:20:55,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:20:55,335 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-02 13:20:55,335 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:20:55,335 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057908327] [2021-11-02 13:20:55,335 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057908327] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:20:55,335 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:20:55,335 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-02 13:20:55,336 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88251681] [2021-11-02 13:20:55,336 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-02 13:20:55,336 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:20:55,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-02 13:20:55,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-02 13:20:55,337 INFO L87 Difference]: Start difference. First operand 229 states and 252 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-02 13:20:57,383 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-02 13:20:58,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:20:58,862 INFO L93 Difference]: Finished difference Result 256 states and 281 transitions. [2021-11-02 13:20:58,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-02 13:20:58,862 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-02 13:20:58,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:20:58,864 INFO L225 Difference]: With dead ends: 256 [2021-11-02 13:20:58,864 INFO L226 Difference]: Without dead ends: 246 [2021-11-02 13:20:58,864 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 166.79ms TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-11-02 13:20:58,865 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 195 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 14 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3073.78ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.66ms SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3422.16ms IncrementalHoareTripleChecker+Time [2021-11-02 13:20:58,865 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [195 Valid, 0 Invalid, 481 Unknown, 0 Unchecked, 2.66ms Time], IncrementalHoareTripleChecker [14 Valid, 466 Invalid, 1 Unknown, 0 Unchecked, 3422.16ms Time] [2021-11-02 13:20:58,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2021-11-02 13:20:58,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 244. [2021-11-02 13:20:58,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 239 states have (on average 1.1255230125523012) internal successors, (269), 243 states have internal predecessors, (269), 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-02 13:20:58,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 269 transitions. [2021-11-02 13:20:58,875 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 269 transitions. Word has length 64 [2021-11-02 13:20:58,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:20:58,875 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 269 transitions. [2021-11-02 13:20:58,875 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-02 13:20:58,876 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 269 transitions. [2021-11-02 13:20:58,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-02 13:20:58,876 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:20:58,876 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-02 13:20:58,876 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-02 13:20:58,877 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 13:20:58,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:20:58,877 INFO L85 PathProgramCache]: Analyzing trace with hash 2002093992, now seen corresponding path program 1 times [2021-11-02 13:20:58,877 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:20:58,877 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916004843] [2021-11-02 13:20:58,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:20:58,878 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:20:58,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:20:59,316 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-02 13:20:59,316 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:20:59,316 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916004843] [2021-11-02 13:20:59,316 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916004843] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:20:59,316 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:20:59,316 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-02 13:20:59,316 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700592881] [2021-11-02 13:20:59,317 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-02 13:20:59,317 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:20:59,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-02 13:20:59,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-11-02 13:20:59,317 INFO L87 Difference]: Start difference. First operand 244 states and 269 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-02 13:21:02,143 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.82s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:21:05,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:21:05,790 INFO L93 Difference]: Finished difference Result 295 states and 320 transitions. [2021-11-02 13:21:05,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-02 13:21:05,791 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-02 13:21:05,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:21:05,792 INFO L225 Difference]: With dead ends: 295 [2021-11-02 13:21:05,792 INFO L226 Difference]: Without dead ends: 233 [2021-11-02 13:21:05,792 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 945.48ms TimeCoverageRelationStatistics Valid=159, Invalid=441, Unknown=0, NotChecked=0, Total=600 [2021-11-02 13:21:05,792 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 396 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 65 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5217.53ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.77ms SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5719.37ms IncrementalHoareTripleChecker+Time [2021-11-02 13:21:05,793 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [396 Valid, 0 Invalid, 1202 Unknown, 0 Unchecked, 6.77ms Time], IncrementalHoareTripleChecker [65 Valid, 1136 Invalid, 1 Unknown, 0 Unchecked, 5719.37ms Time] [2021-11-02 13:21:05,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2021-11-02 13:21:05,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 231. [2021-11-02 13:21:05,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 226 states have (on average 1.1238938053097345) internal successors, (254), 230 states have internal predecessors, (254), 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-02 13:21:05,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 254 transitions. [2021-11-02 13:21:05,803 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 254 transitions. Word has length 64 [2021-11-02 13:21:05,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:21:05,804 INFO L470 AbstractCegarLoop]: Abstraction has 231 states and 254 transitions. [2021-11-02 13:21:05,804 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-02 13:21:05,804 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 254 transitions. [2021-11-02 13:21:05,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-02 13:21:05,805 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:21:05,805 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-02 13:21:05,805 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-02 13:21:05,805 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 13:21:05,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:21:05,806 INFO L85 PathProgramCache]: Analyzing trace with hash 690621047, now seen corresponding path program 1 times [2021-11-02 13:21:05,806 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:21:05,806 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133444345] [2021-11-02 13:21:05,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:21:05,806 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:21:05,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:21:06,554 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-02 13:21:06,555 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:21:06,555 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133444345] [2021-11-02 13:21:06,555 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133444345] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:21:06,555 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:21:06,555 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-02 13:21:06,555 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386666623] [2021-11-02 13:21:06,555 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-02 13:21:06,556 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:21:06,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-02 13:21:06,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-11-02 13:21:06,556 INFO L87 Difference]: Start difference. First operand 231 states and 254 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-02 13:21:09,350 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.79s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:21:13,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:21:13,461 INFO L93 Difference]: Finished difference Result 358 states and 390 transitions. [2021-11-02 13:21:13,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-02 13:21:13,462 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-02 13:21:13,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:21:13,463 INFO L225 Difference]: With dead ends: 358 [2021-11-02 13:21:13,463 INFO L226 Difference]: Without dead ends: 343 [2021-11-02 13:21:13,463 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 1268.00ms TimeCoverageRelationStatistics Valid=195, Invalid=617, Unknown=0, NotChecked=0, Total=812 [2021-11-02 13:21:13,464 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 379 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 1223 mSolverCounterSat, 242 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5418.78ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.74ms SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 1223 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5927.37ms IncrementalHoareTripleChecker+Time [2021-11-02 13:21:13,464 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [379 Valid, 0 Invalid, 1466 Unknown, 0 Unchecked, 6.74ms Time], IncrementalHoareTripleChecker [242 Valid, 1223 Invalid, 1 Unknown, 0 Unchecked, 5927.37ms Time] [2021-11-02 13:21:13,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2021-11-02 13:21:13,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 232. [2021-11-02 13:21:13,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 227 states have (on average 1.1145374449339207) internal successors, (253), 231 states have internal predecessors, (253), 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-02 13:21:13,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 253 transitions. [2021-11-02 13:21:13,475 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 253 transitions. Word has length 64 [2021-11-02 13:21:13,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:21:13,476 INFO L470 AbstractCegarLoop]: Abstraction has 232 states and 253 transitions. [2021-11-02 13:21:13,476 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-02 13:21:13,476 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 253 transitions. [2021-11-02 13:21:13,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-02 13:21:13,477 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:21:13,477 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-02 13:21:13,477 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-02 13:21:13,477 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 13:21:13,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:21:13,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1188769797, now seen corresponding path program 1 times [2021-11-02 13:21:13,478 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:21:13,478 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375672832] [2021-11-02 13:21:13,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:21:13,478 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:21:16,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:21:17,708 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-02 13:21:17,708 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:21:17,708 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375672832] [2021-11-02 13:21:17,708 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375672832] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 13:21:17,708 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629234066] [2021-11-02 13:21:17,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:21:17,709 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 13:21:17,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-02 13:21:17,710 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-02 13:21:17,711 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-02 13:21:18,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:21:18,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 2943 conjuncts, 69 conjunts are in the unsatisfiable core [2021-11-02 13:21:18,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 13:21:18,641 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-02 13:21:19,159 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-02 13:21:19,160 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-02 13:21:19,517 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-02 13:21:20,283 INFO L354 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2021-11-02 13:21:20,284 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 22 treesize of output 24 [2021-11-02 13:21:20,460 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 46 treesize of output 22 [2021-11-02 13:21:20,573 INFO L354 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2021-11-02 13:21:20,573 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 54 treesize of output 26 [2021-11-02 13:21:21,354 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 0 case distinctions, treesize of input 17 treesize of output 9 [2021-11-02 13:21:21,378 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 32 treesize of output 16 [2021-11-02 13:21:22,006 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-02 13:21:22,006 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 27 treesize of output 27 [2021-11-02 13:21:22,222 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-02 13:21:22,222 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 13:21:22,913 INFO L354 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2021-11-02 13:21:22,913 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 65 treesize of output 53 [2021-11-02 13:21:24,991 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.base| Int) (v_DerPreprocessor_1 Int)) (or (and (= |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.offset| c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source.offset) (= c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source.base |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.base|)) (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.base|) |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.offset| v_DerPreprocessor_1)) c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source.base) (+ c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source.offset 8)) 0)))) is different from false [2021-11-02 13:21:27,344 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.base| Int) (v_DerPreprocessor_1 Int)) (or (and (= c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source.base |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.base|) (= c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source.offset 0)) (not (= 0 (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.base|) 0 v_DerPreprocessor_1)) c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source.base) (+ c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source.offset 8)))))) is different from false [2021-11-02 13:21:30,296 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.base| Int) (v_DerPreprocessor_1 Int)) (or (and (= |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_harness_~#cur~3.offset| 0) (= |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_harness_~#cur~3.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.base|)) (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.base|) 0 v_DerPreprocessor_1)) |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_harness_~#cur~3.base|) (+ |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_harness_~#cur~3.offset| 8)) 0)))) is different from false [2021-11-02 13:21:32,380 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.base| Int) (v_DerPreprocessor_2 Int) (v_DerPreprocessor_1 Int)) (or (and (= |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_harness_~#cur~3.offset| 0) (= |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_harness_~#cur~3.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.base|)) (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_2)))) (store .cse0 |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.base| (store (select .cse0 |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.base|) 0 v_DerPreprocessor_1))) |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_harness_~#cur~3.base|) (+ |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_harness_~#cur~3.offset| 8)) 0)))) is different from false [2021-11-02 13:21:34,521 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_save_byte_from_array_~storage.offset Int) (|ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.base| Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_DerPreprocessor_1 Int)) (or (and (= |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_harness_~#cur~3.offset| 0) (= |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_harness_~#cur~3.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.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_3) (+ 8 ULTIMATE.start_save_byte_from_array_~storage.offset) v_DerPreprocessor_2)))) (store .cse0 |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.base| (store (select .cse0 |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.base|) 0 v_DerPreprocessor_1))) |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_harness_~#cur~3.base|) (+ |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_harness_~#cur~3.offset| 8)) 0)))) is different from false [2021-11-02 13:21:38,890 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14620 treesize of output 14428 [2021-11-02 13:21:42,893 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-02 13:21:42,893 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [629234066] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-02 13:21:42,893 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-11-02 13:21:42,895 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 19] total 44 [2021-11-02 13:21:42,895 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295407867] [2021-11-02 13:21:42,897 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2021-11-02 13:21:42,897 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:21:42,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-11-02 13:21:42,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1319, Unknown=5, NotChecked=390, Total=1892 [2021-11-02 13:21:42,898 INFO L87 Difference]: Start difference. First operand 232 states and 253 transitions. Second operand has 44 states, 44 states have (on average 4.0227272727272725) internal successors, (177), 44 states have internal predecessors, (177), 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-02 13:21:45,782 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.88s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:21:49,460 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base) 8)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_harness_~#cur~3.base|) (+ |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_harness_~#cur~3.offset| 8)))) (and (= |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_harness_~#cur~3.offset| c_ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.offset) (forall ((ULTIMATE.start_save_byte_from_array_~storage.offset Int) (|ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.base| Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_DerPreprocessor_1 Int)) (or (and (= |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_harness_~#cur~3.offset| 0) (= |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_harness_~#cur~3.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.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_3) (+ 8 ULTIMATE.start_save_byte_from_array_~storage.offset) v_DerPreprocessor_2)))) (store .cse0 |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.base| (store (select .cse0 |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.base|) 0 v_DerPreprocessor_1))) |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_harness_~#cur~3.base|) (+ |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_harness_~#cur~3.offset| 8)) 0)))) (not (= .cse1 c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base)) (not (= |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_harness_~#cur~3.base| c_ULTIMATE.start_save_byte_from_array_~storage.base)) (= c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset 0) (not (= |c_ULTIMATE.start_bounded_malloc_#res.base| 0)) (not (= .cse2 c_ULTIMATE.start_save_byte_from_array_~storage.base)) (not (= .cse1 0)) (not (= |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_harness_~#cur~3.base| .cse2)) (= |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_harness_~#cur~3.offset| 0) (not (= |c_ULTIMATE.start_bounded_malloc_#res.base| |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_harness_~#cur~3.base|)) (= (select |c_#valid| |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_harness_~#cur~3.base|) 1) (= |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_harness_~#cur~3.base| c_ULTIMATE.start_ensure_byte_cursor_has_allocated_buffer_member_~cursor.base) (= (select |c_#valid| |c_ULTIMATE.start_bounded_malloc_#res.base|) 1) (not (= .cse2 0)) (= (select |c_#valid| .cse2) 1))) is different from false [2021-11-02 13:21:51,471 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_harness_~#cur~3.base|) (+ |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_harness_~#cur~3.offset| 8)))) (and (forall ((ULTIMATE.start_save_byte_from_array_~storage.offset Int) (|ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.base| Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_DerPreprocessor_1 Int)) (or (and (= |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_harness_~#cur~3.offset| 0) (= |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_harness_~#cur~3.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.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_3) (+ 8 ULTIMATE.start_save_byte_from_array_~storage.offset) v_DerPreprocessor_2)))) (store .cse0 |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.base| (store (select .cse0 |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.base|) 0 v_DerPreprocessor_1))) |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_harness_~#cur~3.base|) (+ |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_harness_~#cur~3.offset| 8)) 0)))) (not (= |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_harness_~#cur~3.base| c_ULTIMATE.start_save_byte_from_array_~storage.base)) (not (= .cse1 c_ULTIMATE.start_save_byte_from_array_~storage.base)) (not (= |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_harness_~#cur~3.base| .cse1)) (= |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_harness_~#cur~3.offset| 0) (not (= .cse1 0)))) is different from false [2021-11-02 13:21:53,478 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_harness_~#cur~3.base|) (+ |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_harness_~#cur~3.offset| 8)))) (and (not (= |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_harness_~#cur~3.base| c_ULTIMATE.start_save_byte_from_array_~storage.base)) (not (= .cse0 c_ULTIMATE.start_save_byte_from_array_~storage.base)) (not (= |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_harness_~#cur~3.base| .cse0)) (= |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_harness_~#cur~3.offset| 0) (forall ((|ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.base| Int) (v_DerPreprocessor_2 Int) (v_DerPreprocessor_1 Int)) (or (and (= |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_harness_~#cur~3.offset| 0) (= |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_harness_~#cur~3.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.base|)) (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_2)))) (store .cse1 |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.base| (store (select .cse1 |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.base|) 0 v_DerPreprocessor_1))) |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_harness_~#cur~3.base|) (+ |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_harness_~#cur~3.offset| 8)) 0)))) (not (= .cse0 0)))) is different from false [2021-11-02 13:21:55,483 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_harness_~#cur~3.base|) (+ |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_harness_~#cur~3.offset| 8)))) (and (not (= |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_harness_~#cur~3.base| .cse0)) (= |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_harness_~#cur~3.offset| 0) (forall ((|ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.base| Int) (v_DerPreprocessor_1 Int)) (or (and (= |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_harness_~#cur~3.offset| 0) (= |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_harness_~#cur~3.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.base|)) (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.base|) 0 v_DerPreprocessor_1)) |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_harness_~#cur~3.base|) (+ |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_harness_~#cur~3.offset| 8)) 0)))) (not (= .cse0 0)))) is different from false [2021-11-02 13:21:57,493 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source.base) 8))) (and (forall ((|ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.base| Int) (v_DerPreprocessor_1 Int)) (or (and (= c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source.base |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.base|) (= c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source.offset 0)) (not (= 0 (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.base|) 0 v_DerPreprocessor_1)) c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source.base) (+ c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source.offset 8)))))) (= c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset 0) (= c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source.offset 0) (= c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source.base c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base) (not (= c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source.base .cse0)) (not (= .cse0 0)))) is different from false [2021-11-02 13:21:59,546 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source.base) 8))) (and (forall ((|ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.base| Int) (v_DerPreprocessor_1 Int)) (or (and (= c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source.base |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.base|) (= c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source.offset 0)) (not (= 0 (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.base|) 0 v_DerPreprocessor_1)) c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source.base) (+ c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source.offset 8)))))) (= c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset 0) (= c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source.offset 0) (= c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source.base c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base) (not (= c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source.base .cse0)) (not (= .cse0 0)) (let ((.cse1 (+ 8 c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset))) (or (not |c_ULTIMATE.start_aws_byte_cursor_is_valid_#t~short693|) (not (= (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base) .cse1) 0)) (not (= (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base) .cse1) 0)))))) is different from false [2021-11-02 13:22:01,611 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source.base) 8))) (and (forall ((|ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.base| Int) (v_DerPreprocessor_1 Int)) (or (and (= c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source.base |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.base|) (= c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source.offset 0)) (not (= 0 (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.base|) 0 v_DerPreprocessor_1)) c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source.base) (+ c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source.offset 8)))))) (= c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset 0) (= c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source.offset 0) (= c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source.base c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base) (not (= c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source.base .cse0)) (not (= .cse0 0)) (let ((.cse1 (+ 8 c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset))) (or (not |c_ULTIMATE.start_aws_byte_cursor_is_valid_#t~short697|) (not (= (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base) .cse1) 0)) (not (= (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base) .cse1) 0)))))) is different from false [2021-11-02 13:22:03,687 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source.base) 8))) (and (forall ((|ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.base| Int) (v_DerPreprocessor_1 Int)) (or (and (= c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source.base |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.base|) (= c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source.offset 0)) (not (= 0 (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.base|) 0 v_DerPreprocessor_1)) c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source.base) (+ c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source.offset 8)))))) (= c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset 0) (let ((.cse0 (+ 8 c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.offset))) (or (not (= (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base) .cse0) 0)) (not (= (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base) .cse0) 0)))) (= c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source.offset 0) (= c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source.base c_ULTIMATE.start_aws_byte_cursor_is_valid_~cursor.base) (not (= c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source.base .cse1)) (not (= .cse1 0)))) is different from false [2021-11-02 13:22:05,760 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source.base) 8))) (and (forall ((|ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.base| Int) (v_DerPreprocessor_1 Int)) (or (and (= c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source.base |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.base|) (= c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source.offset 0)) (not (= 0 (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.base|) 0 v_DerPreprocessor_1)) c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source.base) (+ c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source.offset 8)))))) (= c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source.offset 0) (not (= c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source.base .cse0)) (not (= .cse0 0)))) is different from false [2021-11-02 13:22:08,330 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source.base) 8))) (and (= |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.offset| 0) (= c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source.offset 0) (not (= c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source.base .cse0)) (not (= .cse0 0)) (forall ((|ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.base| Int) (v_DerPreprocessor_1 Int)) (or (and (= |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.offset| c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source.offset) (= c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source.base |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.base|)) (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.base|) |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.offset| v_DerPreprocessor_1)) c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source.base) (+ c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source.offset 8)) 0)))))) is different from false [2021-11-02 13:22:10,387 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source.base) 8))) (and (= |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.offset| 0) (or |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_#t~short981| (exists ((|ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.base| Int)) (<= (select (select |c_#memory_int| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.base|) 0) 0))) (= c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source.offset 0) (not (= c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source.base .cse0)) (not (= .cse0 0)) (forall ((|ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.base| Int) (v_DerPreprocessor_1 Int)) (or (and (= |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.offset| c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source.offset) (= c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source.base |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.base|)) (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.base|) |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.offset| v_DerPreprocessor_1)) c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source.base) (+ c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source.offset 8)) 0)))))) is different from false [2021-11-02 13:22:20,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:22:20,524 INFO L93 Difference]: Finished difference Result 551 states and 601 transitions. [2021-11-02 13:22:20,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-11-02 13:22:20,524 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 4.0227272727272725) internal successors, (177), 44 states have internal predecessors, (177), 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-02 13:22:20,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:22:20,526 INFO L225 Difference]: With dead ends: 551 [2021-11-02 13:22:20,526 INFO L226 Difference]: Without dead ends: 456 [2021-11-02 13:22:20,528 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 964 ImplicationChecksByTransitivity, 38019.93ms TimeCoverageRelationStatistics Valid=541, Invalid=2929, Unknown=16, NotChecked=2064, Total=5550 [2021-11-02 13:22:20,528 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 916 mSDsluCounter, 4277 mSDsCounter, 0 mSdLazyCounter, 3485 mSolverCounterSat, 33 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12468.37ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 916 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 7210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 47.28ms SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 3485 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 3691 IncrementalHoareTripleChecker+Unchecked, 13283.56ms IncrementalHoareTripleChecker+Time [2021-11-02 13:22:20,529 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [916 Valid, 0 Invalid, 7210 Unknown, 0 Unchecked, 47.28ms Time], IncrementalHoareTripleChecker [33 Valid, 3485 Invalid, 1 Unknown, 3691 Unchecked, 13283.56ms Time] [2021-11-02 13:22:20,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2021-11-02 13:22:20,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 232. [2021-11-02 13:22:20,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 227 states have (on average 1.1101321585903083) internal successors, (252), 231 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-02 13:22:20,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 252 transitions. [2021-11-02 13:22:20,541 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 252 transitions. Word has length 65 [2021-11-02 13:22:20,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:22:20,541 INFO L470 AbstractCegarLoop]: Abstraction has 232 states and 252 transitions. [2021-11-02 13:22:20,541 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 4.0227272727272725) internal successors, (177), 44 states have internal predecessors, (177), 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-02 13:22:20,542 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 252 transitions. [2021-11-02 13:22:20,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-11-02 13:22:20,542 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:22:20,542 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-02 13:22:20,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-02 13:22:20,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 13:22:20,756 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 13:22:20,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:22:20,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1868828167, now seen corresponding path program 1 times [2021-11-02 13:22:20,757 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:22:20,757 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127392814] [2021-11-02 13:22:20,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:22:20,757 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:22:21,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:22:21,995 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-02 13:22:21,995 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:22:21,995 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127392814] [2021-11-02 13:22:21,995 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127392814] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 13:22:21,995 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996943717] [2021-11-02 13:22:21,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:22:21,996 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 13:22:21,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-02 13:22:21,997 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-02 13:22:21,998 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-02 13:22:23,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:22:23,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 2938 conjuncts, 58 conjunts are in the unsatisfiable core [2021-11-02 13:22:23,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 13:22:23,337 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-02 13:22:23,600 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-02 13:22:23,600 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-02 13:22:24,613 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-11-02 13:22:24,613 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 20 treesize of output 22 [2021-11-02 13:22:24,752 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 19 treesize of output 18 [2021-11-02 13:22:24,881 INFO L354 Elim1Store]: treesize reduction 112, result has 16.4 percent of original size [2021-11-02 13:22:24,881 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 43 [2021-11-02 13:22:40,977 INFO L354 Elim1Store]: treesize reduction 146, result has 42.3 percent of original size [2021-11-02 13:22:40,977 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 55 treesize of output 134 [2021-11-02 13:23:34,220 INFO L354 Elim1Store]: treesize reduction 14, result has 81.3 percent of original size [2021-11-02 13:23:34,221 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 102 treesize of output 126 [2021-11-02 13:23:35,430 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-02 13:23:35,431 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 13:23:38,193 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.base| Int)) (let ((.cse2 (select |c_#memory_int| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.base|))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.offset|))) (let ((.cse1 (select (select (store |c_#memory_int| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.base| (store .cse2 |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.offset| (+ (- 1) .cse0))) c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source.base) c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source.offset))) (or (<= .cse0 0) (= .cse1 0) (< 0 .cse1)))))) is different from false [2021-11-02 13:23:40,235 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.base| Int)) (let ((.cse2 (select |c_#memory_int| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.base|))) (let ((.cse0 (select .cse2 0))) (let ((.cse1 (select (select (store |c_#memory_int| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.base| (store .cse2 0 (+ (- 1) .cse0))) c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source.base) c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_~source.offset))) (or (<= .cse0 0) (< 0 .cse1) (= .cse1 0)))))) is different from false [2021-11-02 13:23:42,699 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.base| Int)) (let ((.cse2 (select |c_#memory_int| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.base|))) (let ((.cse1 (select .cse2 0))) (let ((.cse0 (select (select (store |c_#memory_int| |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.base| (store .cse2 0 (+ (- 1) .cse1))) |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_harness_~#cur~3.base|) |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_harness_~#cur~3.offset|))) (or (< 0 .cse0) (<= .cse1 0) (= 0 .cse0)))))) is different from false [2021-11-02 13:23:44,738 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_save_byte_from_array_~array.base Int) (ULTIMATE.start_save_byte_from_array_~array.offset Int) (|ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.base| Int)) (let ((.cse2 (store |c_#memory_int| c_ULTIMATE.start_save_byte_from_array_~storage.base (let ((.cse4 (select |c_#memory_int| c_ULTIMATE.start_save_byte_from_array_~storage.base))) (store .cse4 (+ 8 c_ULTIMATE.start_save_byte_from_array_~storage.offset) (select (select |c_#memory_int| ULTIMATE.start_save_byte_from_array_~array.base) (+ ULTIMATE.start_save_byte_from_array_~array.offset (select .cse4 c_ULTIMATE.start_save_byte_from_array_~storage.offset)))))))) (let ((.cse3 (select .cse2 |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.base|))) (let ((.cse1 (select .cse3 0))) (let ((.cse0 (select (select (store .cse2 |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.base| (store .cse3 0 (+ (- 1) .cse1))) |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_harness_~#cur~3.base|) |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_harness_~#cur~3.offset|))) (or (< 0 .cse0) (= .cse0 0) (<= .cse1 0))))))) is different from false [2021-11-02 13:23:46,803 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_save_byte_from_array_~storage.offset Int) (|ULTIMATE.start_nondet_size_t_#res| Int) (ULTIMATE.start_save_byte_from_array_~array.base Int) (ULTIMATE.start_save_byte_from_array_~array.offset Int) (|ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.base| Int)) (let ((.cse2 (store |c_#memory_int| c_ULTIMATE.start_save_byte_from_array_~storage.base (let ((.cse4 (store (select |c_#memory_int| c_ULTIMATE.start_save_byte_from_array_~storage.base) ULTIMATE.start_save_byte_from_array_~storage.offset |ULTIMATE.start_nondet_size_t_#res|))) (store .cse4 (+ 8 ULTIMATE.start_save_byte_from_array_~storage.offset) (select (select (store |c_#memory_int| c_ULTIMATE.start_save_byte_from_array_~storage.base .cse4) ULTIMATE.start_save_byte_from_array_~array.base) (+ ULTIMATE.start_save_byte_from_array_~array.offset |ULTIMATE.start_nondet_size_t_#res|))))))) (let ((.cse3 (select .cse2 |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.base|))) (let ((.cse0 (select .cse3 0))) (let ((.cse1 (select (select (store .cse2 |ULTIMATE.start_aws_byte_cursor_right_trim_pred_~#trimmed~0.base| (store .cse3 0 (+ (- 1) .cse0))) |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_harness_~#cur~3.base|) |c_ULTIMATE.start_aws_byte_cursor_right_trim_pred_harness_~#cur~3.offset|))) (or (<= .cse0 0) (< 0 .cse1) (= .cse1 0))))))) is different from false [2021-11-02 13:23:52,281 INFO L354 Elim1Store]: treesize reduction 11, result has 84.9 percent of original size [2021-11-02 13:23:52,282 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 13717 treesize of output 12558 [2021-11-02 13:23:52,372 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-11-02 13:23:52,372 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-11-02 13:23:52,372 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2021-11-02 13:23:52,373 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742571626] [2021-11-02 13:23:52,373 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-02 13:23:52,373 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:23:52,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-02 13:23:52,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1048, Unknown=10, NotChecked=350, Total=1560 [2021-11-02 13:23:52,374 INFO L87 Difference]: Start difference. First operand 232 states and 252 transitions. Second operand has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 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-02 13:23:54,418 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-02 13:24:00,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:24:00,206 INFO L93 Difference]: Finished difference Result 499 states and 542 transitions. [2021-11-02 13:24:00,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-02 13:24:00,207 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 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-02 13:24:00,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:24:00,209 INFO L225 Difference]: With dead ends: 499 [2021-11-02 13:24:00,209 INFO L226 Difference]: Without dead ends: 402 [2021-11-02 13:24:00,210 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 643 ImplicationChecksByTransitivity, 36976.94ms TimeCoverageRelationStatistics Valid=428, Invalid=2132, Unknown=10, NotChecked=510, Total=3080 [2021-11-02 13:24:00,210 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 531 mSDsluCounter, 791 mSDsCounter, 0 mSdLazyCounter, 1382 mSolverCounterSat, 52 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5744.83ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 10.24ms SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1382 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6231.52ms IncrementalHoareTripleChecker+Time [2021-11-02 13:24:00,211 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [531 Valid, 0 Invalid, 1435 Unknown, 0 Unchecked, 10.24ms Time], IncrementalHoareTripleChecker [52 Valid, 1382 Invalid, 1 Unknown, 0 Unchecked, 6231.52ms Time] [2021-11-02 13:24:00,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2021-11-02 13:24:00,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 242. [2021-11-02 13:24:00,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 237 states have (on average 1.1181434599156117) internal successors, (265), 241 states have internal predecessors, (265), 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-02 13:24:00,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 265 transitions. [2021-11-02 13:24:00,225 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 265 transitions. Word has length 65 [2021-11-02 13:24:00,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:24:00,225 INFO L470 AbstractCegarLoop]: Abstraction has 242 states and 265 transitions. [2021-11-02 13:24:00,225 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 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-02 13:24:00,225 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 265 transitions. [2021-11-02 13:24:00,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-02 13:24:00,226 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:24:00,226 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-02 13:24:00,261 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-02 13:24:00,451 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,SelfDestructingSolverStorable30 [2021-11-02 13:24:00,452 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 13:24:00,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:24:00,452 INFO L85 PathProgramCache]: Analyzing trace with hash -23690172, now seen corresponding path program 1 times [2021-11-02 13:24:00,452 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:24:00,452 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886487325] [2021-11-02 13:24:00,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:24:00,453 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:24:00,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:24:00,928 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-02 13:24:00,929 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:24:00,929 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886487325] [2021-11-02 13:24:00,929 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886487325] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 13:24:00,929 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 13:24:00,929 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-02 13:24:00,929 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780963588] [2021-11-02 13:24:00,930 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-02 13:24:00,930 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 13:24:00,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-02 13:24:00,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-02 13:24:00,930 INFO L87 Difference]: Start difference. First operand 242 states and 265 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-02 13:24:02,574 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:24:06,085 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.51s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:24:08,445 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.36s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:24:10,721 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:24:13,010 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-02 13:24:15,291 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:24:17,559 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 13:24:20,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 13:24:20,924 INFO L93 Difference]: Finished difference Result 419 states and 456 transitions. [2021-11-02 13:24:20,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-02 13:24:20,925 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-02 13:24:20,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 13:24:20,925 INFO L225 Difference]: With dead ends: 419 [2021-11-02 13:24:20,925 INFO L226 Difference]: Without dead ends: 344 [2021-11-02 13:24:20,926 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 415.68ms TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2021-11-02 13:24:20,926 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 179 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 1119 mSolverCounterSat, 16 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17401.51ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.43ms SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1119 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19728.46ms IncrementalHoareTripleChecker+Time [2021-11-02 13:24:20,927 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [179 Valid, 0 Invalid, 1141 Unknown, 0 Unchecked, 5.43ms Time], IncrementalHoareTripleChecker [16 Valid, 1119 Invalid, 6 Unknown, 0 Unchecked, 19728.46ms Time] [2021-11-02 13:24:20,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2021-11-02 13:24:20,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 242. [2021-11-02 13:24:20,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 237 states have (on average 1.1139240506329113) internal successors, (264), 241 states have internal predecessors, (264), 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-02 13:24:20,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 264 transitions. [2021-11-02 13:24:20,940 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 264 transitions. Word has length 69 [2021-11-02 13:24:20,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 13:24:20,940 INFO L470 AbstractCegarLoop]: Abstraction has 242 states and 264 transitions. [2021-11-02 13:24:20,940 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-02 13:24:20,941 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 264 transitions. [2021-11-02 13:24:20,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-02 13:24:20,941 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 13:24:20,942 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] [2021-11-02 13:24:20,942 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-02 13:24:20,942 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2021-11-02 13:24:20,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 13:24:20,942 INFO L85 PathProgramCache]: Analyzing trace with hash -103471556, now seen corresponding path program 2 times [2021-11-02 13:24:20,943 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 13:24:20,943 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124509709] [2021-11-02 13:24:20,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 13:24:20,943 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 13:24:21,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 13:24:22,164 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 13:24:22,164 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 13:24:22,164 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124509709] [2021-11-02 13:24:22,164 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124509709] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 13:24:22,164 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971967419] [2021-11-02 13:24:22,164 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-02 13:24:22,165 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 13:24:22,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-02 13:24:22,166 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-02 13:24:22,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process Killed by 15