./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_byte_buf_secure_zero_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_buf_secure_zero_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 9db28b965fea5f2f8d3364c7a869d0042b63b50d32f7a417c3baadcb401d0709 --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-4d01470 [2021-11-02 12:50:10,444 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-02 12:50:10,445 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-02 12:50:10,464 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-02 12:50:10,466 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-02 12:50:10,467 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-02 12:50:10,469 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-02 12:50:10,472 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-02 12:50:10,473 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-02 12:50:10,474 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-02 12:50:10,475 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-02 12:50:10,476 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-02 12:50:10,476 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-02 12:50:10,478 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-02 12:50:10,480 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-02 12:50:10,481 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-02 12:50:10,482 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-02 12:50:10,485 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-02 12:50:10,486 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-02 12:50:10,487 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-02 12:50:10,490 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-02 12:50:10,491 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-02 12:50:10,492 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-02 12:50:10,492 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-02 12:50:10,494 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-02 12:50:10,495 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-02 12:50:10,495 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-02 12:50:10,496 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-02 12:50:10,496 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-02 12:50:10,497 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-02 12:50:10,497 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-02 12:50:10,497 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-02 12:50:10,497 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-02 12:50:10,498 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-02 12:50:10,498 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-02 12:50:10,499 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-02 12:50:10,499 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-02 12:50:10,499 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-02 12:50:10,499 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-02 12:50:10,500 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-02 12:50:10,500 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-02 12:50:10,512 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-02 12:50:10,528 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-02 12:50:10,530 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-02 12:50:10,531 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-02 12:50:10,531 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-02 12:50:10,532 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-02 12:50:10,532 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-02 12:50:10,532 INFO L138 SettingsManager]: * Use SBE=true [2021-11-02 12:50:10,532 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-02 12:50:10,533 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-02 12:50:10,533 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-02 12:50:10,534 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-02 12:50:10,534 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-02 12:50:10,534 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-02 12:50:10,534 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-02 12:50:10,534 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-02 12:50:10,534 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-02 12:50:10,534 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-02 12:50:10,534 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-02 12:50:10,535 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-02 12:50:10,535 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 12:50:10,535 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-02 12:50:10,535 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-02 12:50:10,535 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-02 12:50:10,535 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-02 12:50:10,536 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-02 12:50:10,536 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-02 12:50:10,536 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-02 12:50:10,537 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-02 12:50:10,537 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-02 12:50:10,537 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 -> 9db28b965fea5f2f8d3364c7a869d0042b63b50d32f7a417c3baadcb401d0709 [2021-11-02 12:50:10,749 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-02 12:50:10,768 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-02 12:50:10,770 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-02 12:50:10,770 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-02 12:50:10,771 INFO L275 PluginConnector]: CDTParser initialized [2021-11-02 12:50:10,772 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_byte_buf_secure_zero_harness.i [2021-11-02 12:50:10,812 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/073968db1/bb8b8cea3d964c91abd60a368c56bf16/FLAGbf9467e78 [2021-11-02 12:50:11,466 INFO L306 CDTParser]: Found 1 translation units. [2021-11-02 12:50:11,467 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_secure_zero_harness.i [2021-11-02 12:50:11,508 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/073968db1/bb8b8cea3d964c91abd60a368c56bf16/FLAGbf9467e78 [2021-11-02 12:50:11,855 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/073968db1/bb8b8cea3d964c91abd60a368c56bf16 [2021-11-02 12:50:11,858 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-02 12:50:11,860 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-02 12:50:11,861 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-02 12:50:11,861 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-02 12:50:11,863 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-02 12:50:11,864 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 12:50:11" (1/1) ... [2021-11-02 12:50:11,865 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48648d40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:50:11, skipping insertion in model container [2021-11-02 12:50:11,865 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 12:50:11" (1/1) ... [2021-11-02 12:50:11,869 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-02 12:50:11,936 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-02 12:50:12,154 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_buf_secure_zero_harness.i[4498,4511] [2021-11-02 12:50:12,159 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_buf_secure_zero_harness.i[4558,4571] [2021-11-02 12:50:12,174 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-02 12:50:12,178 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-02 12:50:12,734 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:50:12,735 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:50:12,735 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:50:12,736 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:50:12,736 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:50:12,743 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:50:12,744 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:50:12,745 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:50:12,746 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:50:12,991 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-02 12:50:12,992 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-02 12:50:12,993 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-02 12:50:12,993 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-02 12:50:12,994 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-02 12:50:12,995 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-02 12:50:12,995 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-02 12:50:12,995 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-02 12:50:12,996 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-02 12:50:12,996 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-02 12:50:13,074 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-02 12:50:13,155 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:50:13,156 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:50:13,205 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 12:50:13,233 INFO L203 MainTranslator]: Completed pre-run [2021-11-02 12:50:13,242 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_buf_secure_zero_harness.i[4498,4511] [2021-11-02 12:50:13,248 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_buf_secure_zero_harness.i[4558,4571] [2021-11-02 12:50:13,250 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-02 12:50:13,250 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-02 12:50:13,276 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:50:13,277 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:50:13,277 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:50:13,277 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:50:13,279 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:50:13,293 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:50:13,296 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:50:13,297 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:50:13,299 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:50:13,322 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-02 12:50:13,322 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-02 12:50:13,323 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-02 12:50:13,323 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-02 12:50:13,324 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-02 12:50:13,324 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-02 12:50:13,325 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-02 12:50:13,325 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-02 12:50:13,325 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-02 12:50:13,325 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-02 12:50:13,346 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-02 12:50:13,415 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:50:13,416 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:50:13,437 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 12:50:13,574 INFO L208 MainTranslator]: Completed translation [2021-11-02 12:50:13,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:50:13 WrapperNode [2021-11-02 12:50:13,574 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-02 12:50:13,575 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-02 12:50:13,575 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-02 12:50:13,575 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-02 12:50:13,580 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:50:13" (1/1) ... [2021-11-02 12:50:13,648 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:50:13" (1/1) ... [2021-11-02 12:50:13,710 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-02 12:50:13,711 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-02 12:50:13,711 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-02 12:50:13,711 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-02 12:50:13,720 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:50:13" (1/1) ... [2021-11-02 12:50:13,721 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:50:13" (1/1) ... [2021-11-02 12:50:13,731 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:50:13" (1/1) ... [2021-11-02 12:50:13,732 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:50:13" (1/1) ... [2021-11-02 12:50:13,782 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:50:13" (1/1) ... [2021-11-02 12:50:13,792 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:50:13" (1/1) ... [2021-11-02 12:50:13,801 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:50:13" (1/1) ... [2021-11-02 12:50:13,814 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-02 12:50:13,815 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-02 12:50:13,815 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-02 12:50:13,815 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-02 12:50:13,816 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:50:13" (1/1) ... [2021-11-02 12:50:13,821 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 12:50:13,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-02 12:50:13,839 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 12:50:13,859 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 12:50:13,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-02 12:50:13,875 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-02 12:50:13,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-02 12:50:13,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-02 12:50:13,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-02 12:50:13,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-02 12:50:13,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-02 12:50:13,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-02 12:50:13,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-02 12:50:13,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-02 12:50:13,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-02 12:50:18,303 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-02 12:50:18,304 INFO L299 CfgBuilder]: Removed 59 assume(true) statements. [2021-11-02 12:50:18,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 12:50:18 BoogieIcfgContainer [2021-11-02 12:50:18,305 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-02 12:50:18,306 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-02 12:50:18,307 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-02 12:50:18,309 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-02 12:50:18,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 12:50:11" (1/3) ... [2021-11-02 12:50:18,310 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dd562d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 12:50:18, skipping insertion in model container [2021-11-02 12:50:18,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:50:13" (2/3) ... [2021-11-02 12:50:18,312 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dd562d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 12:50:18, skipping insertion in model container [2021-11-02 12:50:18,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 12:50:18" (3/3) ... [2021-11-02 12:50:18,313 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_secure_zero_harness.i [2021-11-02 12:50:18,318 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-02 12:50:18,319 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2021-11-02 12:50:18,348 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-02 12:50:18,352 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 12:50:18,352 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-11-02 12:50:18,367 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 108 states have (on average 1.4444444444444444) internal successors, (156), 112 states have internal predecessors, (156), 0 states have call successors, (0), 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 12:50:18,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-02 12:50:18,372 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:50:18,372 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] [2021-11-02 12:50:18,373 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-02 12:50:18,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:50:18,376 INFO L85 PathProgramCache]: Analyzing trace with hash -158234594, now seen corresponding path program 1 times [2021-11-02 12:50:18,381 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:50:18,381 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692084478] [2021-11-02 12:50:18,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:50:18,382 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:50:18,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:50:18,912 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 12:50:18,912 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:50:18,912 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692084478] [2021-11-02 12:50:18,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692084478] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:50:18,913 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:50:18,913 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-02 12:50:18,915 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116246453] [2021-11-02 12:50:18,917 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-02 12:50:18,918 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:50:18,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-02 12:50:18,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-02 12:50:18,940 INFO L87 Difference]: Start difference. First operand has 113 states, 108 states have (on average 1.4444444444444444) internal successors, (156), 112 states have internal predecessors, (156), 0 states have call successors, (0), 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 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 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 12:50:19,968 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:50:20,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:50:20,749 INFO L93 Difference]: Finished difference Result 222 states and 307 transitions. [2021-11-02 12:50:20,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-02 12:50:20,751 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2021-11-02 12:50:20,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:50:20,756 INFO L225 Difference]: With dead ends: 222 [2021-11-02 12:50:20,757 INFO L226 Difference]: Without dead ends: 108 [2021-11-02 12:50:20,758 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.03ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-02 12:50:20,760 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1425.91ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.96ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1766.16ms IncrementalHoareTripleChecker+Time [2021-11-02 12:50:20,761 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 145 Unknown, 0 Unchecked, 1.96ms Time], IncrementalHoareTripleChecker [0 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 1766.16ms Time] [2021-11-02 12:50:20,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-11-02 12:50:20,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2021-11-02 12:50:20,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 104 states have (on average 1.3461538461538463) internal successors, (140), 107 states have internal predecessors, (140), 0 states have call successors, (0), 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 12:50:20,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 140 transitions. [2021-11-02 12:50:20,786 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 140 transitions. Word has length 29 [2021-11-02 12:50:20,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:50:20,791 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 140 transitions. [2021-11-02 12:50:20,792 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 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 12:50:20,794 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 140 transitions. [2021-11-02 12:50:20,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-02 12:50:20,796 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:50:20,796 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] [2021-11-02 12:50:20,797 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-02 12:50:20,797 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-02 12:50:20,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:50:20,800 INFO L85 PathProgramCache]: Analyzing trace with hash -4552034, now seen corresponding path program 1 times [2021-11-02 12:50:20,800 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:50:20,801 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386970211] [2021-11-02 12:50:20,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:50:20,802 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:50:20,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:50:21,085 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 12:50:21,086 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:50:21,086 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386970211] [2021-11-02 12:50:21,086 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386970211] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:50:21,086 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:50:21,086 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 12:50:21,086 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243521612] [2021-11-02 12:50:21,087 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 12:50:21,087 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:50:21,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 12:50:21,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-02 12:50:21,088 INFO L87 Difference]: Start difference. First operand 108 states and 140 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 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 12:50:24,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:50:24,694 INFO L93 Difference]: Finished difference Result 190 states and 246 transitions. [2021-11-02 12:50:24,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 12:50:24,695 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2021-11-02 12:50:24,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:50:24,696 INFO L225 Difference]: With dead ends: 190 [2021-11-02 12:50:24,696 INFO L226 Difference]: Without dead ends: 108 [2021-11-02 12:50:24,696 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 33.65ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-02 12:50:24,697 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 123 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2813.41ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.90ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3574.25ms IncrementalHoareTripleChecker+Time [2021-11-02 12:50:24,697 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 0 Invalid, 205 Unknown, 0 Unchecked, 3.90ms Time], IncrementalHoareTripleChecker [5 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 3574.25ms Time] [2021-11-02 12:50:24,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-11-02 12:50:24,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2021-11-02 12:50:24,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 104 states have (on average 1.3173076923076923) internal successors, (137), 107 states have internal predecessors, (137), 0 states have call successors, (0), 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 12:50:24,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 137 transitions. [2021-11-02 12:50:24,710 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 137 transitions. Word has length 29 [2021-11-02 12:50:24,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:50:24,710 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 137 transitions. [2021-11-02 12:50:24,710 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 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 12:50:24,711 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 137 transitions. [2021-11-02 12:50:24,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-02 12:50:24,713 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:50:24,713 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] [2021-11-02 12:50:24,713 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-02 12:50:24,713 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-02 12:50:24,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:50:24,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1058096316, now seen corresponding path program 1 times [2021-11-02 12:50:24,714 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:50:24,714 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107510084] [2021-11-02 12:50:24,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:50:24,715 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:50:24,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:50:24,935 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 12:50:24,935 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:50:24,935 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107510084] [2021-11-02 12:50:24,936 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107510084] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:50:24,936 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:50:24,936 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 12:50:24,936 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090646048] [2021-11-02 12:50:24,936 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 12:50:24,936 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:50:24,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 12:50:24,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 12:50:24,937 INFO L87 Difference]: Start difference. First operand 108 states and 137 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 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 12:50:27,575 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:50:28,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:50:28,959 INFO L93 Difference]: Finished difference Result 231 states and 298 transitions. [2021-11-02 12:50:28,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-02 12:50:28,960 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2021-11-02 12:50:28,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:50:28,961 INFO L225 Difference]: With dead ends: 231 [2021-11-02 12:50:28,961 INFO L226 Difference]: Without dead ends: 148 [2021-11-02 12:50:28,962 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 45.45ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-02 12:50:28,962 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 89 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3231.94ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.80ms SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3967.83ms IncrementalHoareTripleChecker+Time [2021-11-02 12:50:28,962 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 0 Invalid, 440 Unknown, 0 Unchecked, 7.80ms Time], IncrementalHoareTripleChecker [13 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 3967.83ms Time] [2021-11-02 12:50:28,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2021-11-02 12:50:28,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 116. [2021-11-02 12:50:28,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 112 states have (on average 1.2946428571428572) internal successors, (145), 115 states have internal predecessors, (145), 0 states have call successors, (0), 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 12:50:28,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 145 transitions. [2021-11-02 12:50:28,989 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 145 transitions. Word has length 41 [2021-11-02 12:50:28,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:50:28,990 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 145 transitions. [2021-11-02 12:50:28,990 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 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 12:50:28,990 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 145 transitions. [2021-11-02 12:50:28,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-02 12:50:28,991 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:50:28,991 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] [2021-11-02 12:50:28,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-02 12:50:28,991 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-02 12:50:28,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:50:28,993 INFO L85 PathProgramCache]: Analyzing trace with hash 996056702, now seen corresponding path program 1 times [2021-11-02 12:50:28,993 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:50:28,993 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193283553] [2021-11-02 12:50:28,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:50:28,993 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:50:29,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:50:29,358 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 12:50:29,358 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:50:29,358 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193283553] [2021-11-02 12:50:29,358 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193283553] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:50:29,358 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:50:29,358 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-02 12:50:29,359 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415935587] [2021-11-02 12:50:29,359 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-02 12:50:29,359 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:50:29,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-02 12:50:29,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-02 12:50:29,360 INFO L87 Difference]: Start difference. First operand 116 states and 145 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 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 12:50:31,427 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:50:33,673 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:50:36,150 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.48s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:50:37,599 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:50:38,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:50:38,632 INFO L93 Difference]: Finished difference Result 156 states and 191 transitions. [2021-11-02 12:50:38,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-02 12:50:38,633 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2021-11-02 12:50:38,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:50:38,634 INFO L225 Difference]: With dead ends: 156 [2021-11-02 12:50:38,634 INFO L226 Difference]: Without dead ends: 116 [2021-11-02 12:50:38,635 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 225.70ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-11-02 12:50:38,645 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 537 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 9 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8037.26ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 537 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.02ms SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9125.67ms IncrementalHoareTripleChecker+Time [2021-11-02 12:50:38,646 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [537 Valid, 0 Invalid, 243 Unknown, 0 Unchecked, 6.02ms Time], IncrementalHoareTripleChecker [9 Valid, 232 Invalid, 2 Unknown, 0 Unchecked, 9125.67ms Time] [2021-11-02 12:50:38,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-11-02 12:50:38,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2021-11-02 12:50:38,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 112 states have (on average 1.2857142857142858) internal successors, (144), 115 states have internal predecessors, (144), 0 states have call successors, (0), 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 12:50:38,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 144 transitions. [2021-11-02 12:50:38,662 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 144 transitions. Word has length 41 [2021-11-02 12:50:38,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:50:38,663 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 144 transitions. [2021-11-02 12:50:38,663 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 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 12:50:38,663 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 144 transitions. [2021-11-02 12:50:38,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-11-02 12:50:38,665 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:50:38,669 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] [2021-11-02 12:50:38,669 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-02 12:50:38,669 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-02 12:50:38,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:50:38,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1931250963, now seen corresponding path program 1 times [2021-11-02 12:50:38,670 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:50:38,670 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881581632] [2021-11-02 12:50:38,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:50:38,671 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:50:38,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:50:39,119 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 12:50:39,120 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:50:39,120 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881581632] [2021-11-02 12:50:39,120 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881581632] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:50:39,120 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:50:39,120 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-02 12:50:39,120 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831890274] [2021-11-02 12:50:39,120 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-02 12:50:39,120 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:50:39,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-02 12:50:39,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-02 12:50:39,121 INFO L87 Difference]: Start difference. First operand 116 states and 144 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 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 12:50:40,402 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:50:41,838 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:50:43,572 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:50:46,806 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:50:48,461 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:50:50,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:50:50,549 INFO L93 Difference]: Finished difference Result 184 states and 221 transitions. [2021-11-02 12:50:50,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-02 12:50:50,550 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 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 12:50:50,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:50:50,551 INFO L225 Difference]: With dead ends: 184 [2021-11-02 12:50:50,551 INFO L226 Difference]: Without dead ends: 180 [2021-11-02 12:50:50,551 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 204.80ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-11-02 12:50:50,551 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 150 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 28 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9388.66ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.99ms SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11266.68ms IncrementalHoareTripleChecker+Time [2021-11-02 12:50:50,552 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 0 Invalid, 632 Unknown, 0 Unchecked, 7.99ms Time], IncrementalHoareTripleChecker [28 Valid, 603 Invalid, 1 Unknown, 0 Unchecked, 11266.68ms Time] [2021-11-02 12:50:50,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2021-11-02 12:50:50,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 124. [2021-11-02 12:50:50,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 120 states have (on average 1.2666666666666666) internal successors, (152), 123 states have internal predecessors, (152), 0 states have call successors, (0), 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 12:50:50,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 152 transitions. [2021-11-02 12:50:50,556 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 152 transitions. Word has length 47 [2021-11-02 12:50:50,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:50:50,557 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 152 transitions. [2021-11-02 12:50:50,557 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 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 12:50:50,557 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 152 transitions. [2021-11-02 12:50:50,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-02 12:50:50,557 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:50:50,557 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] [2021-11-02 12:50:50,557 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-02 12:50:50,558 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-02 12:50:50,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:50:50,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1524322635, now seen corresponding path program 1 times [2021-11-02 12:50:50,558 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:50:50,558 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49683697] [2021-11-02 12:50:50,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:50:50,558 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:50:50,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:50:50,790 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 12:50:50,790 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:50:50,790 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49683697] [2021-11-02 12:50:50,790 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49683697] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:50:50,790 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:50:50,790 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-02 12:50:50,790 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435942] [2021-11-02 12:50:50,791 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-02 12:50:50,791 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:50:50,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-02 12:50:50,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-02 12:50:50,791 INFO L87 Difference]: Start difference. First operand 124 states and 152 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 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 12:50:52,167 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:50:54,041 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:50:56,442 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.40s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:50:59,634 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:51:01,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:51:01,399 INFO L93 Difference]: Finished difference Result 360 states and 442 transitions. [2021-11-02 12:51:01,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-02 12:51:01,400 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2021-11-02 12:51:01,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:51:01,401 INFO L225 Difference]: With dead ends: 360 [2021-11-02 12:51:01,401 INFO L226 Difference]: Without dead ends: 258 [2021-11-02 12:51:01,401 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 107.19ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-11-02 12:51:01,402 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 237 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 17 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8833.80ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.37ms SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10497.69ms IncrementalHoareTripleChecker+Time [2021-11-02 12:51:01,402 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [237 Valid, 0 Invalid, 529 Unknown, 0 Unchecked, 6.37ms Time], IncrementalHoareTripleChecker [17 Valid, 510 Invalid, 2 Unknown, 0 Unchecked, 10497.69ms Time] [2021-11-02 12:51:01,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2021-11-02 12:51:01,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 152. [2021-11-02 12:51:01,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 148 states have (on average 1.2702702702702702) internal successors, (188), 151 states have internal predecessors, (188), 0 states have call successors, (0), 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 12:51:01,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 188 transitions. [2021-11-02 12:51:01,406 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 188 transitions. Word has length 51 [2021-11-02 12:51:01,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:51:01,407 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 188 transitions. [2021-11-02 12:51:01,407 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 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 12:51:01,407 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 188 transitions. [2021-11-02 12:51:01,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-02 12:51:01,407 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:51:01,407 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] [2021-11-02 12:51:01,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-02 12:51:01,408 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-02 12:51:01,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:51:01,408 INFO L85 PathProgramCache]: Analyzing trace with hash -2090586291, now seen corresponding path program 1 times [2021-11-02 12:51:01,408 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:51:01,408 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96476564] [2021-11-02 12:51:01,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:51:01,408 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:51:02,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:51:03,237 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 12:51:03,237 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:51:03,237 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96476564] [2021-11-02 12:51:03,237 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96476564] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:51:03,238 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:51:03,238 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-02 12:51:03,238 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527197931] [2021-11-02 12:51:03,238 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-02 12:51:03,238 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:51:03,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-02 12:51:03,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-11-02 12:51:03,239 INFO L87 Difference]: Start difference. First operand 152 states and 188 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 0 states have call successors, (0), 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 12:51:04,563 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:51:07,001 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:51:09,241 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:51:11,450 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:51:13,633 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:51:15,798 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:51:17,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:51:17,774 INFO L93 Difference]: Finished difference Result 294 states and 364 transitions. [2021-11-02 12:51:17,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-02 12:51:17,775 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2021-11-02 12:51:17,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:51:17,776 INFO L225 Difference]: With dead ends: 294 [2021-11-02 12:51:17,776 INFO L226 Difference]: Without dead ends: 176 [2021-11-02 12:51:17,777 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 524.07ms TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2021-11-02 12:51:17,777 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 446 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 19 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12711.98ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.12ms SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14134.46ms IncrementalHoareTripleChecker+Time [2021-11-02 12:51:17,778 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [446 Valid, 0 Invalid, 617 Unknown, 0 Unchecked, 9.12ms Time], IncrementalHoareTripleChecker [19 Valid, 593 Invalid, 5 Unknown, 0 Unchecked, 14134.46ms Time] [2021-11-02 12:51:17,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2021-11-02 12:51:17,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 144. [2021-11-02 12:51:17,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 140 states have (on average 1.2571428571428571) internal successors, (176), 143 states have internal predecessors, (176), 0 states have call successors, (0), 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 12:51:17,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 176 transitions. [2021-11-02 12:51:17,782 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 176 transitions. Word has length 51 [2021-11-02 12:51:17,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:51:17,782 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 176 transitions. [2021-11-02 12:51:17,782 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 0 states have call successors, (0), 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 12:51:17,782 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 176 transitions. [2021-11-02 12:51:17,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-11-02 12:51:17,783 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:51:17,783 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 12:51:17,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-02 12:51:17,784 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-02 12:51:17,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:51:17,784 INFO L85 PathProgramCache]: Analyzing trace with hash 363299659, now seen corresponding path program 1 times [2021-11-02 12:51:17,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:51:17,784 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963434003] [2021-11-02 12:51:17,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:51:17,785 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:51:17,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:51:18,276 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 12:51:18,277 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:51:18,277 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963434003] [2021-11-02 12:51:18,277 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963434003] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:51:18,277 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:51:18,277 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-02 12:51:18,277 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218107408] [2021-11-02 12:51:18,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-02 12:51:18,277 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:51:18,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-02 12:51:18,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-11-02 12:51:18,278 INFO L87 Difference]: Start difference. First operand 144 states and 176 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 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 12:51:19,621 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 12:51:21,380 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:51:23,239 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:51:25,661 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:51:27,409 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:51:29,138 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:51:30,856 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:51:32,597 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:51:34,339 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:51:39,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:51:39,059 INFO L93 Difference]: Finished difference Result 377 states and 460 transitions. [2021-11-02 12:51:39,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-02 12:51:39,060 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 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 12:51:39,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:51:39,061 INFO L225 Difference]: With dead ends: 377 [2021-11-02 12:51:39,061 INFO L226 Difference]: Without dead ends: 255 [2021-11-02 12:51:39,061 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 723.44ms TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2021-11-02 12:51:39,062 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 424 mSDsluCounter, 851 mSDsCounter, 0 mSdLazyCounter, 1559 mSolverCounterSat, 33 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16459.64ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 18.71ms SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1559 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20222.97ms IncrementalHoareTripleChecker+Time [2021-11-02 12:51:39,062 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [424 Valid, 0 Invalid, 1593 Unknown, 0 Unchecked, 18.71ms Time], IncrementalHoareTripleChecker [33 Valid, 1559 Invalid, 1 Unknown, 0 Unchecked, 20222.97ms Time] [2021-11-02 12:51:39,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2021-11-02 12:51:39,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 157. [2021-11-02 12:51:39,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 153 states have (on average 1.2156862745098038) internal successors, (186), 156 states have internal predecessors, (186), 0 states have call successors, (0), 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 12:51:39,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 186 transitions. [2021-11-02 12:51:39,067 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 186 transitions. Word has length 59 [2021-11-02 12:51:39,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:51:39,067 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 186 transitions. [2021-11-02 12:51:39,067 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 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 12:51:39,067 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 186 transitions. [2021-11-02 12:51:39,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-11-02 12:51:39,068 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:51:39,068 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 12:51:39,068 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-02 12:51:39,068 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-02 12:51:39,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:51:39,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1749503053, now seen corresponding path program 1 times [2021-11-02 12:51:39,068 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:51:39,068 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560431763] [2021-11-02 12:51:39,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:51:39,068 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:51:39,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:51:39,541 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 12:51:39,541 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:51:39,541 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560431763] [2021-11-02 12:51:39,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560431763] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:51:39,541 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:51:39,541 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-02 12:51:39,541 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890242489] [2021-11-02 12:51:39,542 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-02 12:51:39,542 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:51:39,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-02 12:51:39,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-02 12:51:39,542 INFO L87 Difference]: Start difference. First operand 157 states and 186 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 12:51:40,881 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 12:51:42,653 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:51:45,052 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.40s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:51:47,547 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.49s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:51:49,780 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 12:51:52,265 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.48s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:51:54,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:51:54,507 INFO L93 Difference]: Finished difference Result 312 states and 362 transitions. [2021-11-02 12:51:54,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-02 12:51:54,508 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 12:51:54,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:51:54,508 INFO L225 Difference]: With dead ends: 312 [2021-11-02 12:51:54,508 INFO L226 Difference]: Without dead ends: 186 [2021-11-02 12:51:54,509 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 213.35ms TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-02 12:51:54,509 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 64 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 872 mSolverCounterSat, 22 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12899.44ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.94ms SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 872 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14834.48ms IncrementalHoareTripleChecker+Time [2021-11-02 12:51:54,510 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 0 Invalid, 898 Unknown, 0 Unchecked, 3.94ms Time], IncrementalHoareTripleChecker [22 Valid, 872 Invalid, 4 Unknown, 0 Unchecked, 14834.48ms Time] [2021-11-02 12:51:54,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2021-11-02 12:51:54,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 157. [2021-11-02 12:51:54,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 153 states have (on average 1.196078431372549) internal successors, (183), 156 states have internal predecessors, (183), 0 states have call successors, (0), 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 12:51:54,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 183 transitions. [2021-11-02 12:51:54,514 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 183 transitions. Word has length 59 [2021-11-02 12:51:54,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:51:54,514 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 183 transitions. [2021-11-02 12:51:54,514 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 12:51:54,515 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 183 transitions. [2021-11-02 12:51:54,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-11-02 12:51:54,515 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:51:54,515 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] [2021-11-02 12:51:54,515 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-02 12:51:54,516 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-02 12:51:54,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:51:54,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1291837935, now seen corresponding path program 1 times [2021-11-02 12:51:54,516 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:51:54,516 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521458747] [2021-11-02 12:51:54,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:51:54,516 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:51:54,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:51:54,677 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 12:51:54,677 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:51:54,677 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521458747] [2021-11-02 12:51:54,677 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521458747] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:51:54,677 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:51:54,677 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-02 12:51:54,677 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589030550] [2021-11-02 12:51:54,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 12:51:54,677 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:51:54,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 12:51:54,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 12:51:54,678 INFO L87 Difference]: Start difference. First operand 157 states and 183 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 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 12:51:56,089 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:51:57,857 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:52:00,305 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.45s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:52:01,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:52:01,695 INFO L93 Difference]: Finished difference Result 290 states and 338 transitions. [2021-11-02 12:52:01,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-02 12:52:01,696 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2021-11-02 12:52:01,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:52:01,697 INFO L225 Difference]: With dead ends: 290 [2021-11-02 12:52:01,697 INFO L226 Difference]: Without dead ends: 146 [2021-11-02 12:52:01,697 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 43.70ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-02 12:52:01,697 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 20 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5745.73ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.70ms SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6962.12ms IncrementalHoareTripleChecker+Time [2021-11-02 12:52:01,698 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 0 Invalid, 411 Unknown, 0 Unchecked, 1.70ms Time], IncrementalHoareTripleChecker [11 Valid, 399 Invalid, 1 Unknown, 0 Unchecked, 6962.12ms Time] [2021-11-02 12:52:01,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-11-02 12:52:01,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 134. [2021-11-02 12:52:01,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 130 states have (on average 1.1692307692307693) internal successors, (152), 133 states have internal predecessors, (152), 0 states have call successors, (0), 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 12:52:01,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 152 transitions. [2021-11-02 12:52:01,701 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 152 transitions. Word has length 63 [2021-11-02 12:52:01,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:52:01,702 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 152 transitions. [2021-11-02 12:52:01,702 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 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 12:52:01,702 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 152 transitions. [2021-11-02 12:52:01,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-11-02 12:52:01,702 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:52:01,702 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] [2021-11-02 12:52:01,703 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-02 12:52:01,703 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-02 12:52:01,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:52:01,703 INFO L85 PathProgramCache]: Analyzing trace with hash 354357871, now seen corresponding path program 1 times [2021-11-02 12:52:01,703 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:52:01,704 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420309421] [2021-11-02 12:52:01,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:52:01,704 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:52:01,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:52:01,989 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 12:52:01,990 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:52:01,990 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420309421] [2021-11-02 12:52:01,990 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420309421] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:52:01,990 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:52:01,990 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-02 12:52:01,990 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542787413] [2021-11-02 12:52:01,991 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-02 12:52:01,991 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:52:01,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-02 12:52:01,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-02 12:52:01,991 INFO L87 Difference]: Start difference. First operand 134 states and 152 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 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 12:52:03,350 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:52:05,149 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:52:06,997 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:52:08,788 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:52:10,546 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:52:12,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:52:12,550 INFO L93 Difference]: Finished difference Result 347 states and 396 transitions. [2021-11-02 12:52:12,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-02 12:52:12,551 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2021-11-02 12:52:12,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:52:12,552 INFO L225 Difference]: With dead ends: 347 [2021-11-02 12:52:12,552 INFO L226 Difference]: Without dead ends: 253 [2021-11-02 12:52:12,552 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 320.81ms TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-11-02 12:52:12,553 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 451 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8152.90ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.36ms SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10299.12ms IncrementalHoareTripleChecker+Time [2021-11-02 12:52:12,553 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [451 Valid, 0 Invalid, 550 Unknown, 0 Unchecked, 4.36ms Time], IncrementalHoareTripleChecker [35 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 10299.12ms Time] [2021-11-02 12:52:12,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2021-11-02 12:52:12,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 208. [2021-11-02 12:52:12,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 204 states have (on average 1.161764705882353) internal successors, (237), 207 states have internal predecessors, (237), 0 states have call successors, (0), 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 12:52:12,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 237 transitions. [2021-11-02 12:52:12,558 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 237 transitions. Word has length 63 [2021-11-02 12:52:12,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:52:12,558 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 237 transitions. [2021-11-02 12:52:12,559 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 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 12:52:12,559 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 237 transitions. [2021-11-02 12:52:12,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-11-02 12:52:12,559 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:52:12,559 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] [2021-11-02 12:52:12,560 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-02 12:52:12,560 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-02 12:52:12,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:52:12,560 INFO L85 PathProgramCache]: Analyzing trace with hash 213809261, now seen corresponding path program 1 times [2021-11-02 12:52:12,560 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:52:12,560 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241202524] [2021-11-02 12:52:12,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:52:12,561 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:52:14,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:52:14,599 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 12:52:14,599 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:52:14,599 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241202524] [2021-11-02 12:52:14,600 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241202524] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:52:14,600 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:52:14,600 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-02 12:52:14,600 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549879905] [2021-11-02 12:52:14,600 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-02 12:52:14,600 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:52:14,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-02 12:52:14,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-02 12:52:14,601 INFO L87 Difference]: Start difference. First operand 208 states and 237 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 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 12:52:16,689 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:52:18,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:52:18,112 INFO L93 Difference]: Finished difference Result 411 states and 472 transitions. [2021-11-02 12:52:18,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-02 12:52:18,112 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2021-11-02 12:52:18,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:52:18,114 INFO L225 Difference]: With dead ends: 411 [2021-11-02 12:52:18,114 INFO L226 Difference]: Without dead ends: 291 [2021-11-02 12:52:18,115 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 305.20ms TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2021-11-02 12:52:18,115 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 348 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3126.85ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.61ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3350.64ms IncrementalHoareTripleChecker+Time [2021-11-02 12:52:18,115 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [348 Valid, 0 Invalid, 447 Unknown, 0 Unchecked, 3.61ms Time], IncrementalHoareTripleChecker [7 Valid, 439 Invalid, 1 Unknown, 0 Unchecked, 3350.64ms Time] [2021-11-02 12:52:18,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2021-11-02 12:52:18,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 208. [2021-11-02 12:52:18,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 204 states have (on average 1.1519607843137254) internal successors, (235), 207 states have internal predecessors, (235), 0 states have call successors, (0), 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 12:52:18,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 235 transitions. [2021-11-02 12:52:18,122 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 235 transitions. Word has length 63 [2021-11-02 12:52:18,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:52:18,123 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 235 transitions. [2021-11-02 12:52:18,123 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 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 12:52:18,123 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 235 transitions. [2021-11-02 12:52:18,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-02 12:52:18,123 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:52:18,123 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 12:52:18,124 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-02 12:52:18,124 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-02 12:52:18,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:52:18,124 INFO L85 PathProgramCache]: Analyzing trace with hash 694910338, now seen corresponding path program 1 times [2021-11-02 12:52:18,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:52:18,124 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675569258] [2021-11-02 12:52:18,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:52:18,125 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:52:20,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:52:20,903 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 12:52:20,904 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:52:20,904 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675569258] [2021-11-02 12:52:20,904 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675569258] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:52:20,904 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:52:20,904 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-02 12:52:20,904 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945020516] [2021-11-02 12:52:20,904 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-02 12:52:20,904 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:52:20,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-02 12:52:20,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-11-02 12:52:20,905 INFO L87 Difference]: Start difference. First operand 208 states and 235 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 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 12:52:22,389 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:52:24,203 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:52:26,084 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:52:28,494 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:52:30,857 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 12:52:32,602 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:52:34,364 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:52:36,105 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:52:39,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:52:39,278 INFO L93 Difference]: Finished difference Result 366 states and 413 transitions. [2021-11-02 12:52:39,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-02 12:52:39,278 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 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 12:52:39,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:52:39,279 INFO L225 Difference]: With dead ends: 366 [2021-11-02 12:52:39,279 INFO L226 Difference]: Without dead ends: 270 [2021-11-02 12:52:39,280 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 578.74ms TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2021-11-02 12:52:39,280 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 291 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 1012 mSolverCounterSat, 18 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14594.39ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.89ms SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1012 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17954.05ms IncrementalHoareTripleChecker+Time [2021-11-02 12:52:39,280 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [291 Valid, 0 Invalid, 1032 Unknown, 0 Unchecked, 6.89ms Time], IncrementalHoareTripleChecker [18 Valid, 1012 Invalid, 2 Unknown, 0 Unchecked, 17954.05ms Time] [2021-11-02 12:52:39,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2021-11-02 12:52:39,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 205. [2021-11-02 12:52:39,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 201 states have (on average 1.144278606965174) internal successors, (230), 204 states have internal predecessors, (230), 0 states have call successors, (0), 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 12:52:39,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 230 transitions. [2021-11-02 12:52:39,286 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 230 transitions. Word has length 69 [2021-11-02 12:52:39,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:52:39,286 INFO L470 AbstractCegarLoop]: Abstraction has 205 states and 230 transitions. [2021-11-02 12:52:39,286 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 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 12:52:39,286 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 230 transitions. [2021-11-02 12:52:39,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-02 12:52:39,287 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:52:39,287 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 12:52:39,287 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-02 12:52:39,287 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-02 12:52:39,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:52:39,288 INFO L85 PathProgramCache]: Analyzing trace with hash -738099844, now seen corresponding path program 1 times [2021-11-02 12:52:39,288 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:52:39,288 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085677295] [2021-11-02 12:52:39,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:52:39,288 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:52:39,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:52:39,582 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 12:52:39,582 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:52:39,582 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085677295] [2021-11-02 12:52:39,582 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085677295] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:52:39,582 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:52:39,582 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-02 12:52:39,582 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454121017] [2021-11-02 12:52:39,583 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-02 12:52:39,583 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:52:39,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-02 12:52:39,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-02 12:52:39,583 INFO L87 Difference]: Start difference. First operand 205 states and 230 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 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 12:52:40,919 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 12:52:43,345 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:52:45,062 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:52:47,480 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:52:49,217 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:52:51,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:52:51,087 INFO L93 Difference]: Finished difference Result 291 states and 327 transitions. [2021-11-02 12:52:51,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-02 12:52:51,087 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 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 12:52:51,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:52:51,088 INFO L225 Difference]: With dead ends: 291 [2021-11-02 12:52:51,088 INFO L226 Difference]: Without dead ends: 221 [2021-11-02 12:52:51,089 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 197.51ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-02 12:52:51,089 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 39 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9314.66ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.77ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11362.09ms IncrementalHoareTripleChecker+Time [2021-11-02 12:52:51,089 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 0 Invalid, 610 Unknown, 0 Unchecked, 2.77ms Time], IncrementalHoareTripleChecker [5 Valid, 603 Invalid, 2 Unknown, 0 Unchecked, 11362.09ms Time] [2021-11-02 12:52:51,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2021-11-02 12:52:51,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 205. [2021-11-02 12:52:51,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 201 states have (on average 1.1343283582089552) internal successors, (228), 204 states have internal predecessors, (228), 0 states have call successors, (0), 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 12:52:51,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 228 transitions. [2021-11-02 12:52:51,096 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 228 transitions. Word has length 69 [2021-11-02 12:52:51,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:52:51,097 INFO L470 AbstractCegarLoop]: Abstraction has 205 states and 228 transitions. [2021-11-02 12:52:51,097 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 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 12:52:51,097 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 228 transitions. [2021-11-02 12:52:51,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-02 12:52:51,097 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:52:51,097 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 12:52:51,097 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-02 12:52:51,098 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-02 12:52:51,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:52:51,098 INFO L85 PathProgramCache]: Analyzing trace with hash -58041474, now seen corresponding path program 1 times [2021-11-02 12:52:51,098 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:52:51,098 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734454338] [2021-11-02 12:52:51,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:52:51,098 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:52:52,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:52:53,372 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 12:52:53,373 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:52:53,373 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734454338] [2021-11-02 12:52:53,373 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734454338] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:52:53,373 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:52:53,373 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-02 12:52:53,373 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767910926] [2021-11-02 12:52:53,374 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-02 12:52:53,374 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:52:53,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-02 12:52:53,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-11-02 12:52:53,374 INFO L87 Difference]: Start difference. First operand 205 states and 228 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 12:52:54,840 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:52:56,659 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:52:58,570 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:53:01,008 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:53:04,337 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:53:06,182 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:53:08,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:53:08,608 INFO L93 Difference]: Finished difference Result 371 states and 413 transitions. [2021-11-02 12:53:08,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-02 12:53:08,609 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 12:53:08,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:53:08,610 INFO L225 Difference]: With dead ends: 371 [2021-11-02 12:53:08,610 INFO L226 Difference]: Without dead ends: 265 [2021-11-02 12:53:08,610 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 602.81ms TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-11-02 12:53:08,610 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 340 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 21 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12138.21ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.25ms SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14792.10ms IncrementalHoareTripleChecker+Time [2021-11-02 12:53:08,611 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [340 Valid, 0 Invalid, 595 Unknown, 0 Unchecked, 5.25ms Time], IncrementalHoareTripleChecker [21 Valid, 572 Invalid, 2 Unknown, 0 Unchecked, 14792.10ms Time] [2021-11-02 12:53:08,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2021-11-02 12:53:08,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 205. [2021-11-02 12:53:08,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 201 states have (on average 1.1243781094527363) internal successors, (226), 204 states have internal predecessors, (226), 0 states have call successors, (0), 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 12:53:08,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 226 transitions. [2021-11-02 12:53:08,616 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 226 transitions. Word has length 69 [2021-11-02 12:53:08,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:53:08,616 INFO L470 AbstractCegarLoop]: Abstraction has 205 states and 226 transitions. [2021-11-02 12:53:08,616 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 12:53:08,616 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 226 transitions. [2021-11-02 12:53:08,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-02 12:53:08,617 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:53:08,617 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 12:53:08,617 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-02 12:53:08,617 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-02 12:53:08,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:53:08,617 INFO L85 PathProgramCache]: Analyzing trace with hash -304407622, now seen corresponding path program 1 times [2021-11-02 12:53:08,618 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:53:08,618 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013948418] [2021-11-02 12:53:08,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:53:08,618 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:53:10,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:53:10,865 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 12:53:10,865 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:53:10,865 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013948418] [2021-11-02 12:53:10,866 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013948418] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:53:10,866 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:53:10,866 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-02 12:53:10,866 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329056739] [2021-11-02 12:53:10,866 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-02 12:53:10,866 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:53:10,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-02 12:53:10,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-11-02 12:53:10,867 INFO L87 Difference]: Start difference. First operand 205 states and 226 transitions. Second operand has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 0 states have call successors, (0), 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 12:53:12,376 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:53:14,205 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:53:16,215 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:53:18,651 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.43s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:53:20,995 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:53:23,307 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:53:26,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:53:26,510 INFO L93 Difference]: Finished difference Result 357 states and 395 transitions. [2021-11-02 12:53:26,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-02 12:53:26,510 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2021-11-02 12:53:26,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:53:26,511 INFO L225 Difference]: With dead ends: 357 [2021-11-02 12:53:26,511 INFO L226 Difference]: Without dead ends: 280 [2021-11-02 12:53:26,512 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 992.20ms TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2021-11-02 12:53:26,512 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 613 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 42 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12727.59ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.64ms SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15032.10ms IncrementalHoareTripleChecker+Time [2021-11-02 12:53:26,512 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [613 Valid, 0 Invalid, 815 Unknown, 0 Unchecked, 8.64ms Time], IncrementalHoareTripleChecker [42 Valid, 770 Invalid, 3 Unknown, 0 Unchecked, 15032.10ms Time] [2021-11-02 12:53:26,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2021-11-02 12:53:26,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 230. [2021-11-02 12:53:26,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 226 states have (on average 1.1106194690265487) internal successors, (251), 229 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:53:26,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 251 transitions. [2021-11-02 12:53:26,518 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 251 transitions. Word has length 70 [2021-11-02 12:53:26,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:53:26,518 INFO L470 AbstractCegarLoop]: Abstraction has 230 states and 251 transitions. [2021-11-02 12:53:26,518 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 0 states have call successors, (0), 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 12:53:26,518 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 251 transitions. [2021-11-02 12:53:26,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-02 12:53:26,519 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:53:26,519 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 12:53:26,519 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-02 12:53:26,519 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-02 12:53:26,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:53:26,519 INFO L85 PathProgramCache]: Analyzing trace with hash -61921581, now seen corresponding path program 1 times [2021-11-02 12:53:26,519 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:53:26,519 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295056818] [2021-11-02 12:53:26,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:53:26,520 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:53:26,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:53:26,886 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 12:53:26,887 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:53:26,887 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295056818] [2021-11-02 12:53:26,887 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295056818] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 12:53:26,887 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:53:26,887 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-02 12:53:26,887 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120749887] [2021-11-02 12:53:26,887 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-02 12:53:26,887 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:53:26,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-02 12:53:26,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-02 12:53:26,888 INFO L87 Difference]: Start difference. First operand 230 states and 251 transitions. Second operand has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:53:28,224 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 12:53:30,051 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:53:32,029 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:53:33,873 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:53:35,821 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:53:37,824 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:53:39,881 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:53:42,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:53:42,747 INFO L93 Difference]: Finished difference Result 300 states and 328 transitions. [2021-11-02 12:53:42,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-02 12:53:42,747 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-11-02 12:53:42,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:53:42,748 INFO L225 Difference]: With dead ends: 300 [2021-11-02 12:53:42,748 INFO L226 Difference]: Without dead ends: 296 [2021-11-02 12:53:42,749 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 518.48ms TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2021-11-02 12:53:42,749 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 158 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12226.91ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 15.42ms SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15433.34ms IncrementalHoareTripleChecker+Time [2021-11-02 12:53:42,749 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [158 Valid, 0 Invalid, 867 Unknown, 0 Unchecked, 15.42ms Time], IncrementalHoareTripleChecker [65 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 15433.34ms Time] [2021-11-02 12:53:42,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2021-11-02 12:53:42,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 233. [2021-11-02 12:53:42,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 229 states have (on average 1.1004366812227073) internal successors, (252), 232 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 12:53:42,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 252 transitions. [2021-11-02 12:53:42,756 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 252 transitions. Word has length 72 [2021-11-02 12:53:42,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:53:42,757 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 252 transitions. [2021-11-02 12:53:42,757 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:53:42,757 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 252 transitions. [2021-11-02 12:53:42,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-02 12:53:42,757 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:53:42,757 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 12:53:42,758 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-02 12:53:42,758 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-02 12:53:42,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:53:42,758 INFO L85 PathProgramCache]: Analyzing trace with hash 484257116, now seen corresponding path program 1 times [2021-11-02 12:53:42,758 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 12:53:42,758 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764899507] [2021-11-02 12:53:42,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:53:42,759 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 12:53:44,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:53:46,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 12:53:46,142 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 12:53:46,142 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764899507] [2021-11-02 12:53:46,142 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764899507] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-02 12:53:46,142 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162712556] [2021-11-02 12:53:46,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:53:46,143 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-02 12:53:46,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-02 12:53:46,144 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 12:53:46,145 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 12:53:46,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:53:46,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 2906 conjuncts, 74 conjunts are in the unsatisfiable core [2021-11-02 12:53:46,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 12:53:47,471 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 19 treesize of output 15 [2021-11-02 12:53:48,274 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 21 treesize of output 9 [2021-11-02 12:53:48,690 INFO L354 Elim1Store]: treesize reduction 168, result has 18.0 percent of original size [2021-11-02 12:53:48,691 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 128 treesize of output 154 [2021-11-02 12:53:48,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 12:53:48,840 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 23 [2021-11-02 12:53:48,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 12:53:48,921 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 23 [2021-11-02 12:53:49,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 12:53:49,078 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 25 [2021-11-02 12:53:49,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 12:53:49,153 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 25 [2021-11-02 12:53:49,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 12:53:49,438 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 37 [2021-11-02 12:53:49,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 12:53:49,542 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 75 [2021-11-02 12:53:49,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 12:53:49,723 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 92 [2021-11-02 12:53:51,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 12:53:51,271 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 44 [2021-11-02 12:54:17,192 INFO L354 Elim1Store]: treesize reduction 318, result has 12.9 percent of original size [2021-11-02 12:54:17,193 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 393 treesize of output 246 [2021-11-02 12:54:22,043 INFO L354 Elim1Store]: treesize reduction 134, result has 43.0 percent of original size [2021-11-02 12:54:22,044 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 410 treesize of output 302 [2021-11-02 12:54:22,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 12:54:22,651 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 12:54:27,426 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((aux_mod_ULTIMATE.start_memset_impl_~c_39 Int)) (or (<= 256 aux_mod_ULTIMATE.start_memset_impl_~c_39) (and (forall ((aux_mod_ULTIMATE.start_memset_impl_~i~6_58 Int) (ULTIMATE.start_memset_impl_~sp~0.offset Int)) (or (< aux_mod_ULTIMATE.start_memset_impl_~i~6_58 0) (< 9223372036854775807 aux_mod_ULTIMATE.start_memset_impl_~i~6_58) (not (= (select (store (select (store |c_#memory_int| c_ULTIMATE.start_memset_impl_~sp~0.base (store (select |c_#memory_int| c_ULTIMATE.start_memset_impl_~sp~0.base) (+ ULTIMATE.start_memset_impl_~sp~0.offset (mod aux_mod_ULTIMATE.start_memset_impl_~i~6_58 18446744073709551616)) (+ (- 256) (mod aux_mod_ULTIMATE.start_memset_impl_~c_39 256)))) c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base) c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 0) (+ c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 16)) 0)))) (forall ((aux_mod_ULTIMATE.start_memset_impl_~i~6_58 Int) (ULTIMATE.start_memset_impl_~sp~0.offset Int)) (or (not (= (select (store (select (store |c_#memory_int| c_ULTIMATE.start_memset_impl_~sp~0.base (store (select |c_#memory_int| c_ULTIMATE.start_memset_impl_~sp~0.base) (+ ULTIMATE.start_memset_impl_~sp~0.offset (- 18446744073709551616) (mod aux_mod_ULTIMATE.start_memset_impl_~i~6_58 18446744073709551616)) (+ (- 256) (mod aux_mod_ULTIMATE.start_memset_impl_~c_39 256)))) c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base) c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 0) (+ c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 16)) 0)) (<= aux_mod_ULTIMATE.start_memset_impl_~i~6_58 9223372036854775807) (<= 18446744073709551616 aux_mod_ULTIMATE.start_memset_impl_~i~6_58)))) (<= aux_mod_ULTIMATE.start_memset_impl_~c_39 127))) (forall ((aux_mod_ULTIMATE.start_memset_impl_~c_39 Int)) (or (and (forall ((aux_mod_ULTIMATE.start_memset_impl_~i~6_58 Int) (ULTIMATE.start_memset_impl_~sp~0.offset Int)) (or (< aux_mod_ULTIMATE.start_memset_impl_~i~6_58 0) (< 9223372036854775807 aux_mod_ULTIMATE.start_memset_impl_~i~6_58) (not (= (select (store (select (store |c_#memory_int| c_ULTIMATE.start_memset_impl_~sp~0.base (store (select |c_#memory_int| c_ULTIMATE.start_memset_impl_~sp~0.base) (+ ULTIMATE.start_memset_impl_~sp~0.offset (mod aux_mod_ULTIMATE.start_memset_impl_~i~6_58 18446744073709551616)) (mod aux_mod_ULTIMATE.start_memset_impl_~c_39 256))) c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base) c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 0) (+ c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 16)) 0)))) (forall ((aux_mod_ULTIMATE.start_memset_impl_~i~6_58 Int) (ULTIMATE.start_memset_impl_~sp~0.offset Int)) (or (<= aux_mod_ULTIMATE.start_memset_impl_~i~6_58 9223372036854775807) (<= 18446744073709551616 aux_mod_ULTIMATE.start_memset_impl_~i~6_58) (not (= (select (store (select (store |c_#memory_int| c_ULTIMATE.start_memset_impl_~sp~0.base (store (select |c_#memory_int| c_ULTIMATE.start_memset_impl_~sp~0.base) (+ ULTIMATE.start_memset_impl_~sp~0.offset (- 18446744073709551616) (mod aux_mod_ULTIMATE.start_memset_impl_~i~6_58 18446744073709551616)) (mod aux_mod_ULTIMATE.start_memset_impl_~c_39 256))) c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.base) c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 0) (+ c_ULTIMATE.start_aws_byte_buf_secure_zero_~buf.offset 16)) 0))))) (< 127 aux_mod_ULTIMATE.start_memset_impl_~c_39) (< aux_mod_ULTIMATE.start_memset_impl_~c_39 0)))) is different from false [2021-11-02 12:54:41,244 INFO L354 Elim1Store]: treesize reduction 108, result has 60.7 percent of original size [2021-11-02 12:54:41,244 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 178 treesize of output 276 [2021-11-02 12:54:41,284 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-02 12:54:41,284 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 276 treesize of output 274 [2021-11-02 12:54:41,321 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-02 12:54:41,321 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 274 treesize of output 272 [2021-11-02 12:54:41,360 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-02 12:54:41,360 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 272 treesize of output 270 [2021-11-02 12:54:41,395 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-02 12:54:41,395 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 270 treesize of output 268 [2021-11-02 12:54:41,402 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Should have been eliminated by DER [2021-11-02 12:54:41,410 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-11-02 12:54:41,410 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2021-11-02 12:54:41,410 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227733813] [2021-11-02 12:54:41,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-02 12:54:41,410 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 12:54:41,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-02 12:54:41,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=488, Unknown=3, NotChecked=44, Total=600 [2021-11-02 12:54:41,411 INFO L87 Difference]: Start difference. First operand 233 states and 252 transitions. Second operand has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 13 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:54:41,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-02 12:54:41,412 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 10710.43ms TimeCoverageRelationStatistics Valid=65, Invalid=488, Unknown=3, NotChecked=44, Total=600 [2021-11-02 12:54:41,413 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.00ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.01ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.00ms IncrementalHoareTripleChecker+Time [2021-11-02 12:54:41,413 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 1 Unknown, 0 Unchecked, 0.01ms Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.00ms Time] [2021-11-02 12:54:41,440 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 12:54:41,614 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-11-02 12:54:41,615 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@17dfaffc at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:81) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:359) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:206) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:131) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.checkInternal(ChainingHoareTripleChecker.java:436) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.checkInternal(ChainingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.chooseFalseSuccessor2(BasicAbstractInterpolantAutomaton.java:107) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:73) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:868) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:784) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:462) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-02 12:54:41,618 INFO L158 Benchmark]: Toolchain (without parser) took 269757.92ms. Allocated memory was 104.9MB in the beginning and 425.7MB in the end (delta: 320.9MB). Free memory was 76.2MB in the beginning and 122.1MB in the end (delta: -45.9MB). Peak memory consumption was 274.5MB. Max. memory is 16.1GB. [2021-11-02 12:54:41,618 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 104.9MB. Free memory is still 77.5MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-02 12:54:41,618 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1713.48ms. Allocated memory was 104.9MB in the beginning and 140.5MB in the end (delta: 35.7MB). Free memory was 76.2MB in the beginning and 64.8MB in the end (delta: 11.5MB). Peak memory consumption was 62.2MB. Max. memory is 16.1GB. [2021-11-02 12:54:41,619 INFO L158 Benchmark]: Boogie Procedure Inliner took 135.50ms. Allocated memory is still 140.5MB. Free memory was 64.8MB in the beginning and 52.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-11-02 12:54:41,619 INFO L158 Benchmark]: Boogie Preprocessor took 102.95ms. Allocated memory is still 140.5MB. Free memory was 52.2MB in the beginning and 83.3MB in the end (delta: -31.1MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. [2021-11-02 12:54:41,619 INFO L158 Benchmark]: RCFGBuilder took 4490.80ms. Allocated memory was 140.5MB in the beginning and 339.7MB in the end (delta: 199.2MB). Free memory was 83.3MB in the beginning and 207.8MB in the end (delta: -124.5MB). Peak memory consumption was 207.2MB. Max. memory is 16.1GB. [2021-11-02 12:54:41,619 INFO L158 Benchmark]: TraceAbstraction took 263311.03ms. Allocated memory was 339.7MB in the beginning and 425.7MB in the end (delta: 86.0MB). Free memory was 206.8MB in the beginning and 122.1MB in the end (delta: 84.6MB). Peak memory consumption was 170.1MB. Max. memory is 16.1GB. [2021-11-02 12:54:41,620 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 104.9MB. Free memory is still 77.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1713.48ms. Allocated memory was 104.9MB in the beginning and 140.5MB in the end (delta: 35.7MB). Free memory was 76.2MB in the beginning and 64.8MB in the end (delta: 11.5MB). Peak memory consumption was 62.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 135.50ms. Allocated memory is still 140.5MB. Free memory was 64.8MB in the beginning and 52.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 102.95ms. Allocated memory is still 140.5MB. Free memory was 52.2MB in the beginning and 83.3MB in the end (delta: -31.1MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. * RCFGBuilder took 4490.80ms. Allocated memory was 140.5MB in the beginning and 339.7MB in the end (delta: 199.2MB). Free memory was 83.3MB in the beginning and 207.8MB in the end (delta: -124.5MB). Peak memory consumption was 207.2MB. Max. memory is 16.1GB. * TraceAbstraction took 263311.03ms. Allocated memory was 339.7MB in the beginning and 425.7MB in the end (delta: 86.0MB). Free memory was 206.8MB in the beginning and 122.1MB in the end (delta: 84.6MB). Peak memory consumption was 170.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@17dfaffc de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@17dfaffc: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:81) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-11-02 12:54:41,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_buf_secure_zero_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.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 9db28b965fea5f2f8d3364c7a869d0042b63b50d32f7a417c3baadcb401d0709 --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-4d01470 [2021-11-02 12:54:43,401 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-02 12:54:43,403 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-02 12:54:43,433 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-02 12:54:43,433 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-02 12:54:43,436 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-02 12:54:43,437 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-02 12:54:43,441 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-02 12:54:43,442 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-02 12:54:43,445 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-02 12:54:43,446 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-02 12:54:43,449 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-02 12:54:43,449 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-02 12:54:43,451 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-02 12:54:43,453 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-02 12:54:43,456 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-02 12:54:43,457 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-02 12:54:43,457 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-02 12:54:43,459 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-02 12:54:43,461 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-02 12:54:43,462 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-02 12:54:43,463 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-02 12:54:43,464 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-02 12:54:43,465 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-02 12:54:43,469 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-02 12:54:43,470 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-02 12:54:43,470 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-02 12:54:43,471 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-02 12:54:43,471 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-02 12:54:43,472 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-02 12:54:43,472 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-02 12:54:43,472 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-02 12:54:43,474 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-02 12:54:43,474 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-02 12:54:43,475 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-02 12:54:43,475 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-02 12:54:43,476 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-02 12:54:43,476 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-02 12:54:43,476 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-02 12:54:43,477 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-02 12:54:43,477 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-02 12:54:43,478 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2021-11-02 12:54:43,507 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-02 12:54:43,507 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-02 12:54:43,508 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-02 12:54:43,508 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-02 12:54:43,510 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-02 12:54:43,510 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-02 12:54:43,510 INFO L138 SettingsManager]: * Use SBE=true [2021-11-02 12:54:43,510 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-02 12:54:43,511 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-02 12:54:43,511 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-02 12:54:43,511 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-02 12:54:43,512 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-02 12:54:43,512 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-02 12:54:43,512 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-02 12:54:43,512 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-02 12:54:43,512 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-02 12:54:43,512 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-02 12:54:43,512 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-02 12:54:43,512 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-02 12:54:43,513 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-02 12:54:43,513 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 12:54:43,513 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-02 12:54:43,513 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-02 12:54:43,513 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-02 12:54:43,519 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-02 12:54:43,519 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-02 12:54:43,521 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-02 12:54:43,521 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-02 12:54:43,521 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-02 12:54:43,521 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-02 12:54:43,521 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-02 12:54:43,521 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> 9db28b965fea5f2f8d3364c7a869d0042b63b50d32f7a417c3baadcb401d0709 [2021-11-02 12:54:43,761 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-02 12:54:43,778 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-02 12:54:43,780 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-02 12:54:43,781 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-02 12:54:43,781 INFO L275 PluginConnector]: CDTParser initialized [2021-11-02 12:54:43,782 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_byte_buf_secure_zero_harness.i [2021-11-02 12:54:43,831 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f44621cb/65cf0de62a1a47048f83d4a22377b734/FLAGd42a74794 [2021-11-02 12:54:44,486 INFO L306 CDTParser]: Found 1 translation units. [2021-11-02 12:54:44,487 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_byte_buf_secure_zero_harness.i [2021-11-02 12:54:44,513 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f44621cb/65cf0de62a1a47048f83d4a22377b734/FLAGd42a74794 [2021-11-02 12:54:44,810 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f44621cb/65cf0de62a1a47048f83d4a22377b734 [2021-11-02 12:54:44,813 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-02 12:54:44,814 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-02 12:54:44,816 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-02 12:54:44,816 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-02 12:54:44,819 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-02 12:54:44,820 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 12:54:44" (1/1) ... [2021-11-02 12:54:44,820 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3237fb89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:54:44, skipping insertion in model container [2021-11-02 12:54:44,820 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 12:54:44" (1/1) ... [2021-11-02 12:54:44,826 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-02 12:54:44,917 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-02 12:54:45,108 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_buf_secure_zero_harness.i[4498,4511] [2021-11-02 12:54:45,118 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_buf_secure_zero_harness.i[4558,4571] [2021-11-02 12:54:45,143 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-02 12:54:45,149 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-02 12:54:45,687 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:54:45,689 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:54:45,689 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:54:45,690 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:54:45,691 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:54:45,699 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:54:45,699 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:54:45,700 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:54:45,700 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:54:45,938 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-02 12:54:45,938 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-02 12:54:45,939 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-02 12:54:45,940 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-02 12:54:45,941 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-02 12:54:45,941 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-02 12:54:45,941 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-02 12:54:45,942 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-02 12:54:45,943 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-02 12:54:45,943 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-02 12:54:46,031 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-02 12:54:46,121 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:54:46,122 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:54:46,181 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 12:54:46,234 INFO L203 MainTranslator]: Completed pre-run [2021-11-02 12:54:46,254 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_buf_secure_zero_harness.i[4498,4511] [2021-11-02 12:54:46,254 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_buf_secure_zero_harness.i[4558,4571] [2021-11-02 12:54:46,258 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-11-02 12:54:46,258 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2021-11-02 12:54:46,305 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:54:46,305 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:54:46,306 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:54:46,307 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:54:46,307 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:54:46,324 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:54:46,324 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:54:46,327 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:54:46,327 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:54:46,377 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-11-02 12:54:46,377 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-11-02 12:54:46,378 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-11-02 12:54:46,378 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-11-02 12:54:46,378 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-11-02 12:54:46,379 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-11-02 12:54:46,379 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-11-02 12:54:46,379 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-11-02 12:54:46,379 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-11-02 12:54:46,380 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-11-02 12:54:46,392 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-11-02 12:54:46,457 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:54:46,457 WARN L1529 CHandler]: Possible shadowing of function index [2021-11-02 12:54:46,484 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 12:54:46,760 INFO L208 MainTranslator]: Completed translation [2021-11-02 12:54:46,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:54:46 WrapperNode [2021-11-02 12:54:46,760 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-02 12:54:46,761 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-02 12:54:46,761 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-02 12:54:46,762 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-02 12:54:46,766 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:54:46" (1/1) ... [2021-11-02 12:54:46,830 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:54:46" (1/1) ... [2021-11-02 12:54:46,895 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-02 12:54:46,896 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-02 12:54:46,896 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-02 12:54:46,896 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-02 12:54:46,902 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:54:46" (1/1) ... [2021-11-02 12:54:46,902 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:54:46" (1/1) ... [2021-11-02 12:54:46,915 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:54:46" (1/1) ... [2021-11-02 12:54:46,916 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:54:46" (1/1) ... [2021-11-02 12:54:46,952 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:54:46" (1/1) ... [2021-11-02 12:54:46,956 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:54:46" (1/1) ... [2021-11-02 12:54:46,963 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:54:46" (1/1) ... [2021-11-02 12:54:46,988 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-02 12:54:46,993 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-02 12:54:46,994 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-02 12:54:46,994 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-02 12:54:46,995 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:54:46" (1/1) ... [2021-11-02 12:54:47,005 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 12:54:47,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-02 12:54:47,022 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 12:54:47,028 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 12:54:47,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-02 12:54:47,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-02 12:54:47,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2021-11-02 12:54:47,051 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-02 12:54:47,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-02 12:54:47,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-02 12:54:47,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-02 12:54:47,052 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-11-02 12:54:47,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2021-11-02 12:54:47,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-02 12:54:47,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-02 12:54:47,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2021-11-02 12:54:47,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-11-02 12:54:47,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-02 12:54:53,465 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-02 12:54:53,465 INFO L299 CfgBuilder]: Removed 59 assume(true) statements. [2021-11-02 12:54:53,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 12:54:53 BoogieIcfgContainer [2021-11-02 12:54:53,467 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-02 12:54:53,468 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-02 12:54:53,468 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-02 12:54:53,470 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-02 12:54:53,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 12:54:44" (1/3) ... [2021-11-02 12:54:53,470 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@675f81ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 12:54:53, skipping insertion in model container [2021-11-02 12:54:53,471 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:54:46" (2/3) ... [2021-11-02 12:54:53,471 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@675f81ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 12:54:53, skipping insertion in model container [2021-11-02 12:54:53,471 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 12:54:53" (3/3) ... [2021-11-02 12:54:53,472 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_secure_zero_harness.i [2021-11-02 12:54:53,475 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-02 12:54:53,475 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2021-11-02 12:54:53,512 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-02 12:54:53,521 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 12:54:53,524 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-11-02 12:54:53,540 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 108 states have (on average 1.4444444444444444) internal successors, (156), 112 states have internal predecessors, (156), 0 states have call successors, (0), 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 12:54:53,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-02 12:54:53,545 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:54:53,546 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] [2021-11-02 12:54:53,546 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-02 12:54:53,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:54:53,550 INFO L85 PathProgramCache]: Analyzing trace with hash -158234594, now seen corresponding path program 1 times [2021-11-02 12:54:53,566 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 12:54:53,566 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1203531601] [2021-11-02 12:54:53,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:54:53,567 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 12:54:53,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 12:54:53,569 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 12:54:53,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-02 12:54:55,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:54:55,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 1591 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-02 12:54:55,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 12:54:55,966 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 12:54:55,966 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 12:54:56,029 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 12:54:56,030 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 12:54:56,030 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1203531601] [2021-11-02 12:54:56,030 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1203531601] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 12:54:56,030 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:54:56,031 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-02 12:54:56,032 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615927006] [2021-11-02 12:54:56,035 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-02 12:54:56,035 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 12:54:56,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-02 12:54:56,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-02 12:54:56,070 INFO L87 Difference]: Start difference. First operand has 113 states, 108 states have (on average 1.4444444444444444) internal successors, (156), 112 states have internal predecessors, (156), 0 states have call successors, (0), 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 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 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 12:54:58,332 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:54:59,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:54:59,058 INFO L93 Difference]: Finished difference Result 222 states and 307 transitions. [2021-11-02 12:54:59,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-02 12:54:59,060 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2021-11-02 12:54:59,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:54:59,065 INFO L225 Difference]: With dead ends: 222 [2021-11-02 12:54:59,066 INFO L226 Difference]: Without dead ends: 108 [2021-11-02 12:54:59,067 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.13ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-02 12:54:59,069 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2792.35ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.08ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2934.81ms IncrementalHoareTripleChecker+Time [2021-11-02 12:54:59,070 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 145 Unknown, 0 Unchecked, 3.08ms Time], IncrementalHoareTripleChecker [0 Valid, 144 Invalid, 1 Unknown, 0 Unchecked, 2934.81ms Time] [2021-11-02 12:54:59,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-11-02 12:54:59,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2021-11-02 12:54:59,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 104 states have (on average 1.3461538461538463) internal successors, (140), 107 states have internal predecessors, (140), 0 states have call successors, (0), 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 12:54:59,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 140 transitions. [2021-11-02 12:54:59,099 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 140 transitions. Word has length 29 [2021-11-02 12:54:59,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:54:59,099 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 140 transitions. [2021-11-02 12:54:59,099 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 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 12:54:59,099 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 140 transitions. [2021-11-02 12:54:59,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-02 12:54:59,100 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:54:59,100 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] [2021-11-02 12:54:59,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-02 12:54:59,304 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-02 12:54:59,305 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-02 12:54:59,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:54:59,305 INFO L85 PathProgramCache]: Analyzing trace with hash -4552034, now seen corresponding path program 1 times [2021-11-02 12:54:59,308 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 12:54:59,308 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1053192620] [2021-11-02 12:54:59,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:54:59,309 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 12:54:59,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 12:54:59,310 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 12:54:59,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-02 12:55:01,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:55:01,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 1591 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-02 12:55:01,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 12:55:01,704 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 12:55:01,704 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 12:55:01,876 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 12:55:01,876 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 12:55:01,876 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1053192620] [2021-11-02 12:55:01,876 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1053192620] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 12:55:01,876 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:55:01,876 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-11-02 12:55:01,876 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033691948] [2021-11-02 12:55:01,877 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 12:55:01,877 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 12:55:01,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 12:55:01,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 12:55:01,878 INFO L87 Difference]: Start difference. First operand 108 states and 140 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 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 12:55:04,081 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:55:04,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:55:04,934 INFO L93 Difference]: Finished difference Result 190 states and 246 transitions. [2021-11-02 12:55:04,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-02 12:55:04,934 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2021-11-02 12:55:04,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:55:04,935 INFO L225 Difference]: With dead ends: 190 [2021-11-02 12:55:04,935 INFO L226 Difference]: Without dead ends: 108 [2021-11-02 12:55:04,936 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 54.88ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-02 12:55:04,936 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 197 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2814.52ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.00ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2998.28ms IncrementalHoareTripleChecker+Time [2021-11-02 12:55:04,937 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [197 Valid, 0 Invalid, 203 Unknown, 0 Unchecked, 6.00ms Time], IncrementalHoareTripleChecker [5 Valid, 197 Invalid, 1 Unknown, 0 Unchecked, 2998.28ms Time] [2021-11-02 12:55:04,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-11-02 12:55:04,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2021-11-02 12:55:04,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 104 states have (on average 1.3173076923076923) internal successors, (137), 107 states have internal predecessors, (137), 0 states have call successors, (0), 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 12:55:04,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 137 transitions. [2021-11-02 12:55:04,942 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 137 transitions. Word has length 29 [2021-11-02 12:55:04,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:55:04,942 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 137 transitions. [2021-11-02 12:55:04,942 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 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 12:55:04,942 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 137 transitions. [2021-11-02 12:55:04,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-02 12:55:04,943 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:55:04,943 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] [2021-11-02 12:55:04,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-02 12:55:05,143 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-02 12:55:05,144 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-02 12:55:05,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:55:05,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1058096316, now seen corresponding path program 1 times [2021-11-02 12:55:05,148 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 12:55:05,148 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [101379071] [2021-11-02 12:55:05,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:55:05,149 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 12:55:05,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 12:55:05,149 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 12:55:05,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-02 12:55:07,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:55:07,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 1614 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-02 12:55:07,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 12:55:07,564 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 12:55:07,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 12:55:07,672 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 12:55:07,672 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 12:55:07,673 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [101379071] [2021-11-02 12:55:07,673 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [101379071] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 12:55:07,673 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:55:07,673 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-11-02 12:55:07,673 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209656603] [2021-11-02 12:55:07,673 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-02 12:55:07,673 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 12:55:07,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-02 12:55:07,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-02 12:55:07,674 INFO L87 Difference]: Start difference. First operand 108 states and 137 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 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 12:55:09,864 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:55:11,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:55:11,240 INFO L93 Difference]: Finished difference Result 231 states and 298 transitions. [2021-11-02 12:55:11,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-02 12:55:11,241 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2021-11-02 12:55:11,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:55:11,242 INFO L225 Difference]: With dead ends: 231 [2021-11-02 12:55:11,242 INFO L226 Difference]: Without dead ends: 148 [2021-11-02 12:55:11,242 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 36.20ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-02 12:55:11,243 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 89 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 13 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3344.73ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.83ms SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3509.35ms IncrementalHoareTripleChecker+Time [2021-11-02 12:55:11,243 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 0 Invalid, 438 Unknown, 0 Unchecked, 6.83ms Time], IncrementalHoareTripleChecker [13 Valid, 424 Invalid, 1 Unknown, 0 Unchecked, 3509.35ms Time] [2021-11-02 12:55:11,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2021-11-02 12:55:11,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 116. [2021-11-02 12:55:11,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 112 states have (on average 1.2946428571428572) internal successors, (145), 115 states have internal predecessors, (145), 0 states have call successors, (0), 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 12:55:11,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 145 transitions. [2021-11-02 12:55:11,251 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 145 transitions. Word has length 41 [2021-11-02 12:55:11,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:55:11,251 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 145 transitions. [2021-11-02 12:55:11,252 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 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 12:55:11,252 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 145 transitions. [2021-11-02 12:55:11,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-02 12:55:11,253 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:55:11,253 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] [2021-11-02 12:55:11,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-02 12:55:11,463 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-02 12:55:11,464 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-02 12:55:11,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:55:11,464 INFO L85 PathProgramCache]: Analyzing trace with hash 996056702, now seen corresponding path program 1 times [2021-11-02 12:55:11,467 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 12:55:11,467 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [662883552] [2021-11-02 12:55:11,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:55:11,467 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 12:55:11,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 12:55:11,468 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 12:55:11,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-02 12:55:13,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:55:13,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 1617 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-02 12:55:13,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 12:55:13,997 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 18 treesize of output 14 [2021-11-02 12:55:14,338 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 12:55:14,338 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 12:55:14,597 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 40 treesize of output 34 [2021-11-02 12:55:14,843 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 12:55:14,843 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 12:55:14,843 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [662883552] [2021-11-02 12:55:14,843 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [662883552] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 12:55:14,844 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:55:14,844 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 8] imperfect sequences [] total 13 [2021-11-02 12:55:14,844 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168652467] [2021-11-02 12:55:14,844 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-02 12:55:14,844 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 12:55:14,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-02 12:55:14,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-11-02 12:55:14,845 INFO L87 Difference]: Start difference. First operand 116 states and 145 transitions. Second operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 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 12:55:17,058 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:55:20,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:55:20,572 INFO L93 Difference]: Finished difference Result 227 states and 285 transitions. [2021-11-02 12:55:20,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-02 12:55:20,573 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 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 41 [2021-11-02 12:55:20,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:55:20,573 INFO L225 Difference]: With dead ends: 227 [2021-11-02 12:55:20,573 INFO L226 Difference]: Without dead ends: 138 [2021-11-02 12:55:20,574 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 979.29ms TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2021-11-02 12:55:20,575 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 527 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 823 mSolverCounterSat, 21 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4807.81ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 16.32ms SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 823 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5113.13ms IncrementalHoareTripleChecker+Time [2021-11-02 12:55:20,575 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [527 Valid, 0 Invalid, 845 Unknown, 0 Unchecked, 16.32ms Time], IncrementalHoareTripleChecker [21 Valid, 823 Invalid, 1 Unknown, 0 Unchecked, 5113.13ms Time] [2021-11-02 12:55:20,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2021-11-02 12:55:20,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 112. [2021-11-02 12:55:20,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 108 states have (on average 1.287037037037037) internal successors, (139), 111 states have internal predecessors, (139), 0 states have call successors, (0), 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 12:55:20,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 139 transitions. [2021-11-02 12:55:20,582 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 139 transitions. Word has length 41 [2021-11-02 12:55:20,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:55:20,583 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 139 transitions. [2021-11-02 12:55:20,583 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 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 12:55:20,583 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 139 transitions. [2021-11-02 12:55:20,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-11-02 12:55:20,588 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:55:20,588 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 12:55:20,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-02 12:55:20,798 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-02 12:55:20,799 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-02 12:55:20,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:55:20,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1187507132, now seen corresponding path program 1 times [2021-11-02 12:55:20,802 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 12:55:20,802 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2001602269] [2021-11-02 12:55:20,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:55:20,803 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 12:55:20,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 12:55:20,803 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 12:55:20,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-02 12:55:22,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:55:23,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 1632 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-02 12:55:23,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 12:55:23,249 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-02 12:55:23,249 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 59 treesize of output 23 [2021-11-02 12:55:23,428 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 12:55:23,428 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 12:55:23,740 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 12:55:23,740 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 12:55:23,740 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2001602269] [2021-11-02 12:55:23,741 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2001602269] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 12:55:23,741 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:55:23,741 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2021-11-02 12:55:23,741 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557634593] [2021-11-02 12:55:23,741 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-02 12:55:23,741 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 12:55:23,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-02 12:55:23,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-02 12:55:23,742 INFO L87 Difference]: Start difference. First operand 112 states and 139 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:55:25,951 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:55:29,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:55:29,399 INFO L93 Difference]: Finished difference Result 327 states and 406 transitions. [2021-11-02 12:55:29,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-02 12:55:29,400 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2021-11-02 12:55:29,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:55:29,401 INFO L225 Difference]: With dead ends: 327 [2021-11-02 12:55:29,401 INFO L226 Difference]: Without dead ends: 235 [2021-11-02 12:55:29,402 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 383.06ms TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-11-02 12:55:29,402 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 489 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 28 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5046.66ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 23.20ms SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5427.31ms IncrementalHoareTripleChecker+Time [2021-11-02 12:55:29,403 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [489 Valid, 0 Invalid, 714 Unknown, 0 Unchecked, 23.20ms Time], IncrementalHoareTripleChecker [28 Valid, 685 Invalid, 1 Unknown, 0 Unchecked, 5427.31ms Time] [2021-11-02 12:55:29,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2021-11-02 12:55:29,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 136. [2021-11-02 12:55:29,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 132 states have (on average 1.2803030303030303) internal successors, (169), 135 states have internal predecessors, (169), 0 states have call successors, (0), 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 12:55:29,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 169 transitions. [2021-11-02 12:55:29,410 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 169 transitions. Word has length 49 [2021-11-02 12:55:29,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:55:29,410 INFO L470 AbstractCegarLoop]: Abstraction has 136 states and 169 transitions. [2021-11-02 12:55:29,411 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:55:29,411 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 169 transitions. [2021-11-02 12:55:29,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-11-02 12:55:29,411 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:55:29,412 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 12:55:29,455 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2021-11-02 12:55:29,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-02 12:55:29,620 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-02 12:55:29,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:55:29,620 INFO L85 PathProgramCache]: Analyzing trace with hash 868038652, now seen corresponding path program 1 times [2021-11-02 12:55:29,623 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 12:55:29,623 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1445487504] [2021-11-02 12:55:29,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:55:29,623 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 12:55:29,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 12:55:29,624 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 12:55:29,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-02 12:55:31,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:55:32,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 1626 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-02 12:55:32,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 12:55:32,244 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-02 12:55:32,245 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 59 treesize of output 23 [2021-11-02 12:55:32,684 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 12:55:32,684 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 12:55:33,130 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 12:55:33,130 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 12:55:33,131 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1445487504] [2021-11-02 12:55:33,131 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1445487504] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 12:55:33,131 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:55:33,131 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 12 [2021-11-02 12:55:33,131 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926388030] [2021-11-02 12:55:33,133 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-02 12:55:33,133 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 12:55:33,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-02 12:55:33,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-11-02 12:55:33,134 INFO L87 Difference]: Start difference. First operand 136 states and 169 transitions. Second operand has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:55:35,340 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:55:43,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:55:43,894 INFO L93 Difference]: Finished difference Result 379 states and 447 transitions. [2021-11-02 12:55:43,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-02 12:55:43,896 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2021-11-02 12:55:43,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:55:43,898 INFO L225 Difference]: With dead ends: 379 [2021-11-02 12:55:43,898 INFO L226 Difference]: Without dead ends: 226 [2021-11-02 12:55:43,899 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1821.22ms TimeCoverageRelationStatistics Valid=122, Invalid=430, Unknown=0, NotChecked=0, Total=552 [2021-11-02 12:55:43,903 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 394 mSDsluCounter, 822 mSDsCounter, 0 mSdLazyCounter, 1817 mSolverCounterSat, 104 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8811.26ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 26.94ms SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 1817 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9411.82ms IncrementalHoareTripleChecker+Time [2021-11-02 12:55:43,904 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [394 Valid, 0 Invalid, 1922 Unknown, 0 Unchecked, 26.94ms Time], IncrementalHoareTripleChecker [104 Valid, 1817 Invalid, 1 Unknown, 0 Unchecked, 9411.82ms Time] [2021-11-02 12:55:43,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2021-11-02 12:55:43,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 130. [2021-11-02 12:55:43,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 126 states have (on average 1.2301587301587302) internal successors, (155), 129 states have internal predecessors, (155), 0 states have call successors, (0), 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 12:55:43,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 155 transitions. [2021-11-02 12:55:43,910 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 155 transitions. Word has length 49 [2021-11-02 12:55:43,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:55:43,910 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 155 transitions. [2021-11-02 12:55:43,910 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:55:43,911 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 155 transitions. [2021-11-02 12:55:43,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-02 12:55:43,911 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:55:43,911 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] [2021-11-02 12:55:43,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2021-11-02 12:55:44,119 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-02 12:55:44,120 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-02 12:55:44,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:55:44,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1487976734, now seen corresponding path program 1 times [2021-11-02 12:55:44,123 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 12:55:44,123 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1818284768] [2021-11-02 12:55:44,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:55:44,124 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 12:55:44,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 12:55:44,125 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 12:55:44,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-11-02 12:55:46,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:55:46,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 1639 conjuncts, 24 conjunts are in the unsatisfiable core [2021-11-02 12:55:46,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 12:55:47,118 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 12:55:47,118 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 12:55:47,740 INFO L354 Elim1Store]: treesize reduction 51, result has 40.0 percent of original size [2021-11-02 12:55:47,740 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 36 treesize of output 45 [2021-11-02 12:55:48,339 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 12:55:48,339 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 12:55:48,339 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1818284768] [2021-11-02 12:55:48,339 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1818284768] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 12:55:48,339 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:55:48,340 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 8] imperfect sequences [] total 13 [2021-11-02 12:55:48,340 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095629646] [2021-11-02 12:55:48,340 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-02 12:55:48,340 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 12:55:48,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-02 12:55:48,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-11-02 12:55:48,341 INFO L87 Difference]: Start difference. First operand 130 states and 155 transitions. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 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 12:55:50,534 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:55:54,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:55:54,264 INFO L93 Difference]: Finished difference Result 284 states and 331 transitions. [2021-11-02 12:55:54,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-02 12:55:54,265 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 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 53 [2021-11-02 12:55:54,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:55:54,265 INFO L225 Difference]: With dead ends: 284 [2021-11-02 12:55:54,266 INFO L226 Difference]: Without dead ends: 171 [2021-11-02 12:55:54,266 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1200.73ms TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2021-11-02 12:55:54,266 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 645 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 927 mSolverCounterSat, 33 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4864.57ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.67ms SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 927 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5143.35ms IncrementalHoareTripleChecker+Time [2021-11-02 12:55:54,267 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [645 Valid, 0 Invalid, 961 Unknown, 0 Unchecked, 8.67ms Time], IncrementalHoareTripleChecker [33 Valid, 927 Invalid, 1 Unknown, 0 Unchecked, 5143.35ms Time] [2021-11-02 12:55:54,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2021-11-02 12:55:54,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 126. [2021-11-02 12:55:54,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 122 states have (on average 1.1885245901639345) internal successors, (145), 125 states have internal predecessors, (145), 0 states have call successors, (0), 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 12:55:54,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 145 transitions. [2021-11-02 12:55:54,271 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 145 transitions. Word has length 53 [2021-11-02 12:55:54,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:55:54,271 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 145 transitions. [2021-11-02 12:55:54,271 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 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 12:55:54,271 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 145 transitions. [2021-11-02 12:55:54,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-02 12:55:54,272 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:55:54,272 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] [2021-11-02 12:55:54,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-11-02 12:55:54,499 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-02 12:55:54,500 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-02 12:55:54,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:55:54,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1910678560, now seen corresponding path program 1 times [2021-11-02 12:55:54,503 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 12:55:54,503 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [356045445] [2021-11-02 12:55:54,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:55:54,503 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 12:55:54,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 12:55:54,505 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 12:55:54,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-11-02 12:55:56,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:55:56,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 1636 conjuncts, 22 conjunts are in the unsatisfiable core [2021-11-02 12:55:56,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 12:55:57,510 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 12:55:57,511 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 12:55:58,142 INFO L354 Elim1Store]: treesize reduction 39, result has 46.6 percent of original size [2021-11-02 12:55:58,142 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 32 treesize of output 45 [2021-11-02 12:55:58,910 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 12:55:58,910 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 12:55:58,910 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [356045445] [2021-11-02 12:55:58,910 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [356045445] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 12:55:58,910 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:55:58,910 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 12 [2021-11-02 12:55:58,910 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046526742] [2021-11-02 12:55:58,910 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-02 12:55:58,911 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 12:55:58,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-02 12:55:58,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-11-02 12:55:58,911 INFO L87 Difference]: Start difference. First operand 126 states and 145 transitions. Second operand has 12 states, 12 states have (on average 7.5) internal successors, (90), 12 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:56:01,118 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:56:05,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:56:05,298 INFO L93 Difference]: Finished difference Result 323 states and 375 transitions. [2021-11-02 12:56:05,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-02 12:56:05,299 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.5) internal successors, (90), 12 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2021-11-02 12:56:05,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:56:05,300 INFO L225 Difference]: With dead ends: 323 [2021-11-02 12:56:05,300 INFO L226 Difference]: Without dead ends: 237 [2021-11-02 12:56:05,300 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1081.17ms TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2021-11-02 12:56:05,301 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 421 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 890 mSolverCounterSat, 36 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5341.49ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 8.69ms SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 890 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5668.54ms IncrementalHoareTripleChecker+Time [2021-11-02 12:56:05,301 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [421 Valid, 0 Invalid, 927 Unknown, 0 Unchecked, 8.69ms Time], IncrementalHoareTripleChecker [36 Valid, 890 Invalid, 1 Unknown, 0 Unchecked, 5668.54ms Time] [2021-11-02 12:56:05,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2021-11-02 12:56:05,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 196. [2021-11-02 12:56:05,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 192 states have (on average 1.1822916666666667) internal successors, (227), 195 states have internal predecessors, (227), 0 states have call successors, (0), 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 12:56:05,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 227 transitions. [2021-11-02 12:56:05,307 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 227 transitions. Word has length 53 [2021-11-02 12:56:05,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:56:05,307 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 227 transitions. [2021-11-02 12:56:05,307 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.5) internal successors, (90), 12 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:56:05,307 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 227 transitions. [2021-11-02 12:56:05,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-02 12:56:05,308 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:56:05,308 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] [2021-11-02 12:56:05,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-11-02 12:56:05,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-02 12:56:05,523 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-02 12:56:05,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:56:05,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1104425058, now seen corresponding path program 1 times [2021-11-02 12:56:05,527 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 12:56:05,527 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1648490608] [2021-11-02 12:56:05,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:56:05,527 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 12:56:05,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 12:56:05,528 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 12:56:05,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-11-02 12:56:07,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:56:07,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 1633 conjuncts, 14 conjunts are in the unsatisfiable core [2021-11-02 12:56:07,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 12:56:08,023 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 18 treesize of output 14 [2021-11-02 12:56:08,744 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 16 treesize of output 8 [2021-11-02 12:56:08,814 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 12:56:08,814 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 12:56:09,319 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 40 treesize of output 34 [2021-11-02 12:56:09,615 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 12:56:09,615 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 12:56:09,615 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1648490608] [2021-11-02 12:56:09,615 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1648490608] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 12:56:09,615 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:56:09,615 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 12 [2021-11-02 12:56:09,615 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303855896] [2021-11-02 12:56:09,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-02 12:56:09,616 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 12:56:09,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-02 12:56:09,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-11-02 12:56:09,616 INFO L87 Difference]: Start difference. First operand 196 states and 227 transitions. Second operand has 12 states, 12 states have (on average 8.166666666666666) internal successors, (98), 12 states have internal predecessors, (98), 0 states have call successors, (0), 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 12:56:11,836 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:56:14,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:56:14,363 INFO L93 Difference]: Finished difference Result 379 states and 445 transitions. [2021-11-02 12:56:14,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-02 12:56:14,364 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.166666666666666) internal successors, (98), 12 states have internal predecessors, (98), 0 states have call successors, (0), 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 53 [2021-11-02 12:56:14,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:56:14,365 INFO L225 Difference]: With dead ends: 379 [2021-11-02 12:56:14,365 INFO L226 Difference]: Without dead ends: 271 [2021-11-02 12:56:14,366 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 701.96ms TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2021-11-02 12:56:14,366 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 626 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 12 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4198.43ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 626 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.77ms SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4478.91ms IncrementalHoareTripleChecker+Time [2021-11-02 12:56:14,366 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [626 Valid, 0 Invalid, 570 Unknown, 0 Unchecked, 6.77ms Time], IncrementalHoareTripleChecker [12 Valid, 557 Invalid, 1 Unknown, 0 Unchecked, 4478.91ms Time] [2021-11-02 12:56:14,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2021-11-02 12:56:14,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 196. [2021-11-02 12:56:14,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 192 states have (on average 1.171875) internal successors, (225), 195 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:56:14,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 225 transitions. [2021-11-02 12:56:14,372 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 225 transitions. Word has length 53 [2021-11-02 12:56:14,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:56:14,373 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 225 transitions. [2021-11-02 12:56:14,373 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.166666666666666) internal successors, (98), 12 states have internal predecessors, (98), 0 states have call successors, (0), 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 12:56:14,373 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 225 transitions. [2021-11-02 12:56:14,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-11-02 12:56:14,374 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:56:14,374 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 12:56:14,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-11-02 12:56:14,579 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-02 12:56:14,580 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-02 12:56:14,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:56:14,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1626553075, now seen corresponding path program 1 times [2021-11-02 12:56:14,583 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 12:56:14,583 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1203809916] [2021-11-02 12:56:14,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:56:14,584 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 12:56:14,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 12:56:14,584 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 12:56:14,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-11-02 12:56:16,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:56:16,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 1667 conjuncts, 31 conjunts are in the unsatisfiable core [2021-11-02 12:56:16,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 12:56:17,998 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-02 12:56:17,999 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 11 [2021-11-02 12:56:18,182 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 12:56:18,182 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 12:56:21,498 INFO L354 Elim1Store]: treesize reduction 51, result has 40.0 percent of original size [2021-11-02 12:56:21,499 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 53 treesize of output 50 [2021-11-02 12:56:22,289 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 12:56:22,289 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 12:56:22,289 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1203809916] [2021-11-02 12:56:22,289 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1203809916] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 12:56:22,289 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:56:22,290 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 9] imperfect sequences [] total 17 [2021-11-02 12:56:22,290 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89754364] [2021-11-02 12:56:22,290 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-02 12:56:22,290 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 12:56:22,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-02 12:56:22,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=211, Unknown=1, NotChecked=0, Total=272 [2021-11-02 12:56:22,291 INFO L87 Difference]: Start difference. First operand 196 states and 225 transitions. Second operand has 17 states, 17 states have (on average 6.294117647058823) internal successors, (107), 17 states have internal predecessors, (107), 0 states have call successors, (0), 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 12:56:24,520 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:56:30,506 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:56:31,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:56:31,642 INFO L93 Difference]: Finished difference Result 321 states and 372 transitions. [2021-11-02 12:56:31,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-02 12:56:31,643 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.294117647058823) internal successors, (107), 17 states have internal predecessors, (107), 0 states have call successors, (0), 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 12:56:31,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:56:31,645 INFO L225 Difference]: With dead ends: 321 [2021-11-02 12:56:31,646 INFO L226 Difference]: Without dead ends: 205 [2021-11-02 12:56:31,646 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 4685.60ms TimeCoverageRelationStatistics Valid=189, Invalid=460, Unknown=1, NotChecked=0, Total=650 [2021-11-02 12:56:31,647 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 239 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 22 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7397.24ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.50ms SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 839 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 2 IncrementalHoareTripleChecker+Unchecked, 7773.77ms IncrementalHoareTripleChecker+Time [2021-11-02 12:56:31,647 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [239 Valid, 0 Invalid, 865 Unknown, 0 Unchecked, 7.50ms Time], IncrementalHoareTripleChecker [22 Valid, 839 Invalid, 2 Unknown, 2 Unchecked, 7773.77ms Time] [2021-11-02 12:56:31,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2021-11-02 12:56:31,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 196. [2021-11-02 12:56:31,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 192 states have (on average 1.1614583333333333) internal successors, (223), 195 states have internal predecessors, (223), 0 states have call successors, (0), 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 12:56:31,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 223 transitions. [2021-11-02 12:56:31,656 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 223 transitions. Word has length 59 [2021-11-02 12:56:31,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:56:31,656 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 223 transitions. [2021-11-02 12:56:31,656 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.294117647058823) internal successors, (107), 17 states have internal predecessors, (107), 0 states have call successors, (0), 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 12:56:31,656 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 223 transitions. [2021-11-02 12:56:31,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-11-02 12:56:31,657 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:56:31,657 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 12:56:31,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-11-02 12:56:31,875 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-02 12:56:31,876 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-02 12:56:31,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:56:31,876 INFO L85 PathProgramCache]: Analyzing trace with hash -546318801, now seen corresponding path program 1 times [2021-11-02 12:56:31,879 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 12:56:31,879 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [430685489] [2021-11-02 12:56:31,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:56:31,879 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 12:56:31,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 12:56:31,880 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 12:56:31,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-11-02 12:56:33,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:56:34,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 1671 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-02 12:56:34,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 12:56:34,452 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 12:56:34,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 12:56:34,865 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 12:56:34,865 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 12:56:34,865 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [430685489] [2021-11-02 12:56:34,865 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [430685489] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 12:56:34,865 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:56:34,865 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-02 12:56:34,865 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30936181] [2021-11-02 12:56:34,866 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-02 12:56:34,866 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 12:56:34,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-02 12:56:34,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-02 12:56:34,866 INFO L87 Difference]: Start difference. First operand 196 states and 223 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 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 12:56:37,067 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:56:38,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:56:38,011 INFO L93 Difference]: Finished difference Result 258 states and 295 transitions. [2021-11-02 12:56:38,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-02 12:56:38,012 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 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 12:56:38,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:56:38,013 INFO L225 Difference]: With dead ends: 258 [2021-11-02 12:56:38,013 INFO L226 Difference]: Without dead ends: 196 [2021-11-02 12:56:38,013 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 125.09ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-02 12:56:38,013 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 222 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2907.60ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.98ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3036.51ms IncrementalHoareTripleChecker+Time [2021-11-02 12:56:38,014 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [222 Valid, 0 Invalid, 213 Unknown, 0 Unchecked, 2.98ms Time], IncrementalHoareTripleChecker [3 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 3036.51ms Time] [2021-11-02 12:56:38,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2021-11-02 12:56:38,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2021-11-02 12:56:38,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 192 states have (on average 1.1510416666666667) internal successors, (221), 195 states have internal predecessors, (221), 0 states have call successors, (0), 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 12:56:38,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 221 transitions. [2021-11-02 12:56:38,019 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 221 transitions. Word has length 60 [2021-11-02 12:56:38,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:56:38,019 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 221 transitions. [2021-11-02 12:56:38,019 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 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 12:56:38,020 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 221 transitions. [2021-11-02 12:56:38,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-11-02 12:56:38,020 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:56:38,020 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] [2021-11-02 12:56:38,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-11-02 12:56:38,225 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-02 12:56:38,225 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-02 12:56:38,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:56:38,225 INFO L85 PathProgramCache]: Analyzing trace with hash 274168836, now seen corresponding path program 1 times [2021-11-02 12:56:38,229 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 12:56:38,229 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1957076934] [2021-11-02 12:56:38,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:56:38,229 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 12:56:38,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 12:56:38,230 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 12:56:38,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-11-02 12:56:40,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:56:40,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 1684 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-02 12:56:40,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 12:56:40,655 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 12:56:40,655 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 12:56:40,788 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 12:56:40,788 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 12:56:40,788 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1957076934] [2021-11-02 12:56:40,788 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1957076934] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 12:56:40,789 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:56:40,789 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 8 [2021-11-02 12:56:40,789 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831395549] [2021-11-02 12:56:40,789 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-02 12:56:40,789 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 12:56:40,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-02 12:56:40,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-02 12:56:40,790 INFO L87 Difference]: Start difference. First operand 196 states and 221 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 12:56:42,998 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:56:45,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:56:45,237 INFO L93 Difference]: Finished difference Result 267 states and 302 transitions. [2021-11-02 12:56:45,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-02 12:56:45,238 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 66 [2021-11-02 12:56:45,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:56:45,239 INFO L225 Difference]: With dead ends: 267 [2021-11-02 12:56:45,239 INFO L226 Difference]: Without dead ends: 263 [2021-11-02 12:56:45,239 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 311.56ms TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2021-11-02 12:56:45,240 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 168 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 31 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4015.85ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.55ms SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4213.77ms IncrementalHoareTripleChecker+Time [2021-11-02 12:56:45,240 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [168 Valid, 0 Invalid, 670 Unknown, 0 Unchecked, 5.55ms Time], IncrementalHoareTripleChecker [31 Valid, 638 Invalid, 1 Unknown, 0 Unchecked, 4213.77ms Time] [2021-11-02 12:56:45,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2021-11-02 12:56:45,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 208. [2021-11-02 12:56:45,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 204 states have (on average 1.142156862745098) internal successors, (233), 207 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 12:56:45,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 233 transitions. [2021-11-02 12:56:45,246 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 233 transitions. Word has length 66 [2021-11-02 12:56:45,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:56:45,246 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 233 transitions. [2021-11-02 12:56:45,246 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 12:56:45,246 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 233 transitions. [2021-11-02 12:56:45,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-02 12:56:45,247 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:56:45,247 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 12:56:45,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-11-02 12:56:45,459 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-02 12:56:45,460 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-02 12:56:45,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:56:45,460 INFO L85 PathProgramCache]: Analyzing trace with hash 448544190, now seen corresponding path program 1 times [2021-11-02 12:56:45,463 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 12:56:45,463 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [922251623] [2021-11-02 12:56:45,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:56:45,464 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 12:56:45,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 12:56:45,464 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 12:56:45,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-11-02 12:56:47,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:56:47,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 1690 conjuncts, 32 conjunts are in the unsatisfiable core [2021-11-02 12:56:47,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 12:56:49,111 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-02 12:56:49,111 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 11 [2021-11-02 12:56:50,369 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 12:56:50,369 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 12:56:52,571 INFO L354 Elim1Store]: treesize reduction 51, result has 40.0 percent of original size [2021-11-02 12:56:52,571 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 53 treesize of output 50 [2021-11-02 12:56:53,489 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 12:56:53,489 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 12:56:53,489 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [922251623] [2021-11-02 12:56:53,489 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [922251623] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 12:56:53,489 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 12:56:53,490 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [] total 19 [2021-11-02 12:56:53,490 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090242786] [2021-11-02 12:56:53,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-02 12:56:53,490 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 12:56:53,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-02 12:56:53,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2021-11-02 12:56:53,491 INFO L87 Difference]: Start difference. First operand 208 states and 233 transitions. Second operand has 19 states, 19 states have (on average 6.2631578947368425) internal successors, (119), 19 states have internal predecessors, (119), 0 states have call successors, (0), 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 12:56:55,693 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:57:03,201 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-02 12:57:04,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 12:57:04,515 INFO L93 Difference]: Finished difference Result 297 states and 334 transitions. [2021-11-02 12:57:04,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-02 12:57:04,516 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 6.2631578947368425) internal successors, (119), 19 states have internal predecessors, (119), 0 states have call successors, (0), 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 70 [2021-11-02 12:57:04,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 12:57:04,516 INFO L225 Difference]: With dead ends: 297 [2021-11-02 12:57:04,516 INFO L226 Difference]: Without dead ends: 169 [2021-11-02 12:57:04,517 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 4789.41ms TimeCoverageRelationStatistics Valid=207, Invalid=549, Unknown=0, NotChecked=0, Total=756 [2021-11-02 12:57:04,517 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 139 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 1045 mSolverCounterSat, 15 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8665.75ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 11.10ms SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1045 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 126 IncrementalHoareTripleChecker+Unchecked, 9216.00ms IncrementalHoareTripleChecker+Time [2021-11-02 12:57:04,517 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 0 Invalid, 1188 Unknown, 0 Unchecked, 11.10ms Time], IncrementalHoareTripleChecker [15 Valid, 1045 Invalid, 2 Unknown, 126 Unchecked, 9216.00ms Time] [2021-11-02 12:57:04,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2021-11-02 12:57:04,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 152. [2021-11-02 12:57:04,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 148 states have (on average 1.1283783783783783) internal successors, (167), 151 states have internal predecessors, (167), 0 states have call successors, (0), 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 12:57:04,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 167 transitions. [2021-11-02 12:57:04,522 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 167 transitions. Word has length 70 [2021-11-02 12:57:04,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 12:57:04,522 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 167 transitions. [2021-11-02 12:57:04,522 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.2631578947368425) internal successors, (119), 19 states have internal predecessors, (119), 0 states have call successors, (0), 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 12:57:04,522 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 167 transitions. [2021-11-02 12:57:04,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-02 12:57:04,522 INFO L506 BasicCegarLoop]: Found error trace [2021-11-02 12:57:04,523 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 12:57:04,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-11-02 12:57:04,723 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-02 12:57:04,723 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-02 12:57:04,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 12:57:04,724 INFO L85 PathProgramCache]: Analyzing trace with hash 484257116, now seen corresponding path program 1 times [2021-11-02 12:57:04,726 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 12:57:04,727 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1244502432] [2021-11-02 12:57:04,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 12:57:04,727 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 12:57:04,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-02 12:57:04,732 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 12:57:04,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-11-02 12:59:43,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 12:59:44,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 1695 conjuncts, 56 conjunts are in the unsatisfiable core [2021-11-02 12:59:44,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 12:59:44,646 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 12:59:44,953 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-02 12:59:44,953 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2021-11-02 12:59:45,060 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 19 treesize of output 1 [2021-11-02 12:59:45,072 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 18 treesize of output 14 [2021-11-02 12:59:46,849 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-02 12:59:46,850 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 8 [2021-11-02 12:59:47,207 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-02 12:59:47,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 12:59:47,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 12:59:47,215 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-02 12:59:47,342 INFO L354 Elim1Store]: treesize reduction 144, result has 15.8 percent of original size [2021-11-02 12:59:47,342 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 50 treesize of output 52 [2021-11-02 12:59:48,407 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-02 12:59:48,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 12:59:48,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 12:59:48,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 12:59:48,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 12:59:48,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 12:59:48,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-02 12:59:48,430 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-02 12:59:48,476 INFO L354 Elim1Store]: treesize reduction 104, result has 6.3 percent of original size [2021-11-02 12:59:48,477 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 61 treesize of output 69 [2021-11-02 12:59:48,864 INFO L354 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2021-11-02 12:59:48,865 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 90 treesize of output 46 [2021-11-02 12:59:49,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 12:59:49,048 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 12:59:58,296 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 222 treesize of output 198 [2021-11-02 13:01:24,812 WARN L210 SmtUtils]: Spent 1.44m on a formula simplification. DAG size of input: 120 DAG size of output: 95 [2021-11-02 13:01:24,813 INFO L354 Elim1Store]: treesize reduction 199, result has 57.7 percent of original size [2021-11-02 13:01:24,813 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 470 treesize of output 573 [2021-11-02 13:01:24,987 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-02 13:01:24,987 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 573 treesize of output 579 [2021-11-02 13:01:25,355 INFO L354 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2021-11-02 13:01:25,355 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 579 treesize of output 581 [2021-11-02 13:01:25,831 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 Killed by 15