./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f29f5fb0-698a-4d77-a57e-d6a83d418d30/bin/uautomizer-Z5i5R5N3CC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f29f5fb0-698a-4d77-a57e-d6a83d418d30/bin/uautomizer-Z5i5R5N3CC/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f29f5fb0-698a-4d77-a57e-d6a83d418d30/bin/uautomizer-Z5i5R5N3CC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f29f5fb0-698a-4d77-a57e-d6a83d418d30/bin/uautomizer-Z5i5R5N3CC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f29f5fb0-698a-4d77-a57e-d6a83d418d30/bin/uautomizer-Z5i5R5N3CC/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f29f5fb0-698a-4d77-a57e-d6a83d418d30/bin/uautomizer-Z5i5R5N3CC --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 32bit --witnessprinter.graph.data.programhash e45e933f699aab7bcc9592c7af081e2fbc1238f5 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2021-10-11 00:34:05,582 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-11 00:34:05,585 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-11 00:34:05,639 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-11 00:34:05,640 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-11 00:34:05,646 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-11 00:34:05,648 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-11 00:34:05,650 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-11 00:34:05,652 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-11 00:34:05,653 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-11 00:34:05,657 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-11 00:34:05,659 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-11 00:34:05,660 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-11 00:34:05,669 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-11 00:34:05,671 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-11 00:34:05,674 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-11 00:34:05,676 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-11 00:34:05,682 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-11 00:34:05,685 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-11 00:34:05,691 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-11 00:34:05,693 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-11 00:34:05,696 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-11 00:34:05,700 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-11 00:34:05,701 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-11 00:34:05,706 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-11 00:34:05,706 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-11 00:34:05,707 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-11 00:34:05,708 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-11 00:34:05,709 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-11 00:34:05,710 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-11 00:34:05,710 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-11 00:34:05,711 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-11 00:34:05,712 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-11 00:34:05,713 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-11 00:34:05,714 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-11 00:34:05,714 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-11 00:34:05,715 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-11 00:34:05,715 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-11 00:34:05,716 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-11 00:34:05,717 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-11 00:34:05,717 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-11 00:34:05,718 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f29f5fb0-698a-4d77-a57e-d6a83d418d30/bin/uautomizer-Z5i5R5N3CC/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-11 00:34:05,757 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-11 00:34:05,758 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-11 00:34:05,760 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-11 00:34:05,761 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-11 00:34:05,761 INFO L138 SettingsManager]: * Use SBE=true [2021-10-11 00:34:05,761 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-11 00:34:05,762 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-11 00:34:05,762 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-11 00:34:05,762 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-11 00:34:05,762 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-11 00:34:05,764 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-11 00:34:05,764 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-11 00:34:05,764 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-11 00:34:05,764 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-11 00:34:05,765 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-11 00:34:05,765 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-11 00:34:05,765 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-11 00:34:05,765 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-11 00:34:05,766 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-11 00:34:05,766 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-11 00:34:05,766 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-11 00:34:05,766 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-11 00:34:05,766 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-11 00:34:05,767 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-11 00:34:05,767 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-11 00:34:05,767 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-11 00:34:05,767 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-11 00:34:05,768 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-11 00:34:05,768 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f29f5fb0-698a-4d77-a57e-d6a83d418d30/bin/uautomizer-Z5i5R5N3CC/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f29f5fb0-698a-4d77-a57e-d6a83d418d30/bin/uautomizer-Z5i5R5N3CC 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e45e933f699aab7bcc9592c7af081e2fbc1238f5 [2021-10-11 00:34:06,031 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-11 00:34:06,075 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-11 00:34:06,077 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-11 00:34:06,079 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-11 00:34:06,080 INFO L275 PluginConnector]: CDTParser initialized [2021-10-11 00:34:06,081 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f29f5fb0-698a-4d77-a57e-d6a83d418d30/bin/uautomizer-Z5i5R5N3CC/../../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2021-10-11 00:34:06,164 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f29f5fb0-698a-4d77-a57e-d6a83d418d30/bin/uautomizer-Z5i5R5N3CC/data/5f154a579/83d7bbbce6274e478d7e96df8f370603/FLAG48aa480d6 [2021-10-11 00:34:06,662 INFO L306 CDTParser]: Found 1 translation units. [2021-10-11 00:34:06,663 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f29f5fb0-698a-4d77-a57e-d6a83d418d30/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2021-10-11 00:34:06,672 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f29f5fb0-698a-4d77-a57e-d6a83d418d30/bin/uautomizer-Z5i5R5N3CC/data/5f154a579/83d7bbbce6274e478d7e96df8f370603/FLAG48aa480d6 [2021-10-11 00:34:07,037 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f29f5fb0-698a-4d77-a57e-d6a83d418d30/bin/uautomizer-Z5i5R5N3CC/data/5f154a579/83d7bbbce6274e478d7e96df8f370603 [2021-10-11 00:34:07,039 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-11 00:34:07,041 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-11 00:34:07,051 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-11 00:34:07,051 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-11 00:34:07,055 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-11 00:34:07,055 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:34:07" (1/1) ... [2021-10-11 00:34:07,057 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17fbc55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:34:07, skipping insertion in model container [2021-10-11 00:34:07,058 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:34:07" (1/1) ... [2021-10-11 00:34:07,067 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-11 00:34:07,107 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-11 00:34:07,273 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f29f5fb0-698a-4d77-a57e-d6a83d418d30/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[1551,1564] [2021-10-11 00:34:07,277 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f29f5fb0-698a-4d77-a57e-d6a83d418d30/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[1758,1771] [2021-10-11 00:34:07,280 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f29f5fb0-698a-4d77-a57e-d6a83d418d30/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2095,2108] [2021-10-11 00:34:07,282 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f29f5fb0-698a-4d77-a57e-d6a83d418d30/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2296,2309] [2021-10-11 00:34:07,291 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f29f5fb0-698a-4d77-a57e-d6a83d418d30/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2701,2714] [2021-10-11 00:34:07,295 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f29f5fb0-698a-4d77-a57e-d6a83d418d30/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2902,2915] [2021-10-11 00:34:07,302 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f29f5fb0-698a-4d77-a57e-d6a83d418d30/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3228,3241] [2021-10-11 00:34:07,314 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f29f5fb0-698a-4d77-a57e-d6a83d418d30/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3435,3448] [2021-10-11 00:34:07,318 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f29f5fb0-698a-4d77-a57e-d6a83d418d30/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3914,3927] [2021-10-11 00:34:07,320 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f29f5fb0-698a-4d77-a57e-d6a83d418d30/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4118,4131] [2021-10-11 00:34:07,322 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f29f5fb0-698a-4d77-a57e-d6a83d418d30/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4426,4439] [2021-10-11 00:34:07,324 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f29f5fb0-698a-4d77-a57e-d6a83d418d30/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4630,4643] [2021-10-11 00:34:07,327 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f29f5fb0-698a-4d77-a57e-d6a83d418d30/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4995,5008] [2021-10-11 00:34:07,329 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f29f5fb0-698a-4d77-a57e-d6a83d418d30/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5198,5211] [2021-10-11 00:34:07,331 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f29f5fb0-698a-4d77-a57e-d6a83d418d30/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5412,5425] [2021-10-11 00:34:07,333 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f29f5fb0-698a-4d77-a57e-d6a83d418d30/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5616,5629] [2021-10-11 00:34:07,335 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f29f5fb0-698a-4d77-a57e-d6a83d418d30/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[6138,6151] [2021-10-11 00:34:07,337 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f29f5fb0-698a-4d77-a57e-d6a83d418d30/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[6342,6355] [2021-10-11 00:34:07,340 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 00:34:07,363 INFO L203 MainTranslator]: Completed pre-run [2021-10-11 00:34:07,396 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f29f5fb0-698a-4d77-a57e-d6a83d418d30/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[1551,1564] [2021-10-11 00:34:07,397 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f29f5fb0-698a-4d77-a57e-d6a83d418d30/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[1758,1771] [2021-10-11 00:34:07,399 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f29f5fb0-698a-4d77-a57e-d6a83d418d30/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2095,2108] [2021-10-11 00:34:07,400 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f29f5fb0-698a-4d77-a57e-d6a83d418d30/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2296,2309] [2021-10-11 00:34:07,411 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f29f5fb0-698a-4d77-a57e-d6a83d418d30/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2701,2714] [2021-10-11 00:34:07,414 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f29f5fb0-698a-4d77-a57e-d6a83d418d30/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2902,2915] [2021-10-11 00:34:07,425 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f29f5fb0-698a-4d77-a57e-d6a83d418d30/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3228,3241] [2021-10-11 00:34:07,427 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f29f5fb0-698a-4d77-a57e-d6a83d418d30/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3435,3448] [2021-10-11 00:34:07,430 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f29f5fb0-698a-4d77-a57e-d6a83d418d30/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3914,3927] [2021-10-11 00:34:07,432 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f29f5fb0-698a-4d77-a57e-d6a83d418d30/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4118,4131] [2021-10-11 00:34:07,434 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f29f5fb0-698a-4d77-a57e-d6a83d418d30/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4426,4439] [2021-10-11 00:34:07,435 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f29f5fb0-698a-4d77-a57e-d6a83d418d30/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4630,4643] [2021-10-11 00:34:07,438 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f29f5fb0-698a-4d77-a57e-d6a83d418d30/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4995,5008] [2021-10-11 00:34:07,453 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f29f5fb0-698a-4d77-a57e-d6a83d418d30/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5198,5211] [2021-10-11 00:34:07,454 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f29f5fb0-698a-4d77-a57e-d6a83d418d30/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5412,5425] [2021-10-11 00:34:07,456 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f29f5fb0-698a-4d77-a57e-d6a83d418d30/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5616,5629] [2021-10-11 00:34:07,458 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f29f5fb0-698a-4d77-a57e-d6a83d418d30/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[6138,6151] [2021-10-11 00:34:07,459 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f29f5fb0-698a-4d77-a57e-d6a83d418d30/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[6342,6355] [2021-10-11 00:34:07,462 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 00:34:07,476 INFO L208 MainTranslator]: Completed translation [2021-10-11 00:34:07,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:34:07 WrapperNode [2021-10-11 00:34:07,476 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-11 00:34:07,478 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-11 00:34:07,478 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-11 00:34:07,478 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-11 00:34:07,486 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:34:07" (1/1) ... [2021-10-11 00:34:07,495 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:34:07" (1/1) ... [2021-10-11 00:34:07,522 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-11 00:34:07,523 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-11 00:34:07,523 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-11 00:34:07,523 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-11 00:34:07,532 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:34:07" (1/1) ... [2021-10-11 00:34:07,532 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:34:07" (1/1) ... [2021-10-11 00:34:07,535 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:34:07" (1/1) ... [2021-10-11 00:34:07,536 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:34:07" (1/1) ... [2021-10-11 00:34:07,541 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:34:07" (1/1) ... [2021-10-11 00:34:07,544 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:34:07" (1/1) ... [2021-10-11 00:34:07,547 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:34:07" (1/1) ... [2021-10-11 00:34:07,550 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-11 00:34:07,551 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-11 00:34:07,551 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-11 00:34:07,551 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-11 00:34:07,555 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:34:07" (1/1) ... No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f29f5fb0-698a-4d77-a57e-d6a83d418d30/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-11 00:34:07,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-11 00:34:07,641 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-11 00:34:07,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-11 00:34:07,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-11 00:34:08,196 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-11 00:34:08,197 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-10-11 00:34:08,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:34:08 BoogieIcfgContainer [2021-10-11 00:34:08,199 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-11 00:34:08,201 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-11 00:34:08,201 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-11 00:34:08,205 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-11 00:34:08,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:34:07" (1/3) ... [2021-10-11 00:34:08,206 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64f08862 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:34:08, skipping insertion in model container [2021-10-11 00:34:08,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:34:07" (2/3) ... [2021-10-11 00:34:08,207 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64f08862 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:34:08, skipping insertion in model container [2021-10-11 00:34:08,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:34:08" (3/3) ... [2021-10-11 00:34:08,208 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i.v+cfa-reducer.c [2021-10-11 00:34:08,223 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-11 00:34:08,226 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2021-10-11 00:34:08,238 INFO L253 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2021-10-11 00:34:08,264 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-10-11 00:34:08,264 INFO L378 AbstractCegarLoop]: Hoare is true [2021-10-11 00:34:08,265 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-10-11 00:34:08,265 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-10-11 00:34:08,265 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-10-11 00:34:08,265 INFO L382 AbstractCegarLoop]: Difference is false [2021-10-11 00:34:08,265 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-10-11 00:34:08,265 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-10-11 00:34:08,288 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2021-10-11 00:34:08,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-11 00:34:08,294 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:34:08,294 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:34:08,295 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:34:08,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:34:08,302 INFO L82 PathProgramCache]: Analyzing trace with hash -2034435078, now seen corresponding path program 1 times [2021-10-11 00:34:08,312 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:34:08,313 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330486269] [2021-10-11 00:34:08,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:34:08,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:34:08,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:34:08,669 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330486269] [2021-10-11 00:34:08,669 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:34:08,670 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:34:08,671 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115686025] [2021-10-11 00:34:08,675 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 00:34:08,676 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:34:08,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:34:08,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:34:08,712 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 3 states. [2021-10-11 00:34:08,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:34:08,743 INFO L93 Difference]: Finished difference Result 88 states and 123 transitions. [2021-10-11 00:34:08,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:34:08,745 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2021-10-11 00:34:08,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:34:08,755 INFO L225 Difference]: With dead ends: 88 [2021-10-11 00:34:08,755 INFO L226 Difference]: Without dead ends: 76 [2021-10-11 00:34:08,758 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:34:08,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-10-11 00:34:08,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2021-10-11 00:34:08,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2021-10-11 00:34:08,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2021-10-11 00:34:08,801 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 15 [2021-10-11 00:34:08,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:34:08,801 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2021-10-11 00:34:08,802 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 00:34:08,802 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2021-10-11 00:34:08,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-11 00:34:08,803 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:34:08,803 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:34:08,803 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-11 00:34:08,804 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:34:08,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:34:08,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1357026114, now seen corresponding path program 1 times [2021-10-11 00:34:08,805 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:34:08,806 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735542412] [2021-10-11 00:34:08,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:34:08,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:34:08,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:34:08,882 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735542412] [2021-10-11 00:34:08,882 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:34:08,882 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-11 00:34:08,883 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212599698] [2021-10-11 00:34:08,884 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 00:34:08,885 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:34:08,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 00:34:08,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-10-11 00:34:08,887 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 6 states. [2021-10-11 00:34:08,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:34:08,986 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2021-10-11 00:34:08,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 00:34:08,987 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2021-10-11 00:34:08,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:34:08,989 INFO L225 Difference]: With dead ends: 76 [2021-10-11 00:34:08,989 INFO L226 Difference]: Without dead ends: 74 [2021-10-11 00:34:08,990 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-10-11 00:34:08,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-10-11 00:34:08,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2021-10-11 00:34:08,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2021-10-11 00:34:09,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2021-10-11 00:34:09,001 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 16 [2021-10-11 00:34:09,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:34:09,002 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2021-10-11 00:34:09,002 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 00:34:09,002 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2021-10-11 00:34:09,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-11 00:34:09,003 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:34:09,003 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:34:09,004 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-11 00:34:09,004 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:34:09,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:34:09,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1567835227, now seen corresponding path program 1 times [2021-10-11 00:34:09,006 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:34:09,006 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971912547] [2021-10-11 00:34:09,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:34:09,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:34:09,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:34:09,089 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971912547] [2021-10-11 00:34:09,089 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:34:09,090 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 00:34:09,091 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156820314] [2021-10-11 00:34:09,092 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 00:34:09,093 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:34:09,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 00:34:09,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 00:34:09,096 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 4 states. [2021-10-11 00:34:09,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:34:09,221 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2021-10-11 00:34:09,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 00:34:09,222 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2021-10-11 00:34:09,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:34:09,228 INFO L225 Difference]: With dead ends: 97 [2021-10-11 00:34:09,229 INFO L226 Difference]: Without dead ends: 95 [2021-10-11 00:34:09,230 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:34:09,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-10-11 00:34:09,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 72. [2021-10-11 00:34:09,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2021-10-11 00:34:09,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2021-10-11 00:34:09,253 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 18 [2021-10-11 00:34:09,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:34:09,253 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2021-10-11 00:34:09,253 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 00:34:09,254 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2021-10-11 00:34:09,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-11 00:34:09,255 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:34:09,255 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:34:09,256 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-11 00:34:09,256 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:34:09,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:34:09,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1358247672, now seen corresponding path program 1 times [2021-10-11 00:34:09,257 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:34:09,257 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248155905] [2021-10-11 00:34:09,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:34:09,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:34:09,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:34:09,354 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248155905] [2021-10-11 00:34:09,354 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:34:09,354 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 00:34:09,355 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973331611] [2021-10-11 00:34:09,355 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 00:34:09,355 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:34:09,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 00:34:09,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:34:09,357 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand 5 states. [2021-10-11 00:34:09,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:34:09,436 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2021-10-11 00:34:09,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 00:34:09,437 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2021-10-11 00:34:09,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:34:09,439 INFO L225 Difference]: With dead ends: 72 [2021-10-11 00:34:09,440 INFO L226 Difference]: Without dead ends: 70 [2021-10-11 00:34:09,440 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-11 00:34:09,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-10-11 00:34:09,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2021-10-11 00:34:09,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2021-10-11 00:34:09,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2021-10-11 00:34:09,457 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 19 [2021-10-11 00:34:09,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:34:09,457 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2021-10-11 00:34:09,457 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 00:34:09,457 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2021-10-11 00:34:09,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-11 00:34:09,458 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:34:09,458 INFO L422 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] [2021-10-11 00:34:09,458 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-11 00:34:09,458 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:34:09,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:34:09,459 INFO L82 PathProgramCache]: Analyzing trace with hash -665385716, now seen corresponding path program 1 times [2021-10-11 00:34:09,459 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:34:09,459 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552706542] [2021-10-11 00:34:09,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:34:09,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:34:09,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:34:09,554 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552706542] [2021-10-11 00:34:09,554 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:34:09,554 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 00:34:09,554 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855543308] [2021-10-11 00:34:09,555 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 00:34:09,555 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:34:09,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 00:34:09,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:34:09,556 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 5 states. [2021-10-11 00:34:09,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:34:09,719 INFO L93 Difference]: Finished difference Result 137 states and 143 transitions. [2021-10-11 00:34:09,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-11 00:34:09,721 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2021-10-11 00:34:09,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:34:09,723 INFO L225 Difference]: With dead ends: 137 [2021-10-11 00:34:09,723 INFO L226 Difference]: Without dead ends: 135 [2021-10-11 00:34:09,725 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-10-11 00:34:09,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-10-11 00:34:09,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 73. [2021-10-11 00:34:09,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2021-10-11 00:34:09,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2021-10-11 00:34:09,746 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 22 [2021-10-11 00:34:09,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:34:09,747 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2021-10-11 00:34:09,747 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 00:34:09,747 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2021-10-11 00:34:09,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-11 00:34:09,751 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:34:09,752 INFO L422 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] [2021-10-11 00:34:09,752 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-11 00:34:09,753 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:34:09,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:34:09,754 INFO L82 PathProgramCache]: Analyzing trace with hash -661217951, now seen corresponding path program 1 times [2021-10-11 00:34:09,754 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:34:09,755 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677721522] [2021-10-11 00:34:09,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:34:09,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:34:09,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:34:09,846 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677721522] [2021-10-11 00:34:09,847 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:34:09,848 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 00:34:09,848 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108369051] [2021-10-11 00:34:09,848 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 00:34:09,849 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:34:09,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 00:34:09,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:34:09,850 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand 5 states. [2021-10-11 00:34:09,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:34:09,982 INFO L93 Difference]: Finished difference Result 104 states and 110 transitions. [2021-10-11 00:34:09,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-11 00:34:09,983 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2021-10-11 00:34:09,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:34:09,984 INFO L225 Difference]: With dead ends: 104 [2021-10-11 00:34:09,984 INFO L226 Difference]: Without dead ends: 102 [2021-10-11 00:34:09,985 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-10-11 00:34:09,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-10-11 00:34:10,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 75. [2021-10-11 00:34:10,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2021-10-11 00:34:10,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2021-10-11 00:34:10,006 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 22 [2021-10-11 00:34:10,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:34:10,007 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2021-10-11 00:34:10,007 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 00:34:10,007 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2021-10-11 00:34:10,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-11 00:34:10,008 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:34:10,008 INFO L422 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] [2021-10-11 00:34:10,008 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-11 00:34:10,008 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:34:10,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:34:10,013 INFO L82 PathProgramCache]: Analyzing trace with hash 847883539, now seen corresponding path program 1 times [2021-10-11 00:34:10,013 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:34:10,014 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054772991] [2021-10-11 00:34:10,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:34:10,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:34:10,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:34:10,102 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054772991] [2021-10-11 00:34:10,102 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:34:10,102 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 00:34:10,103 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899088942] [2021-10-11 00:34:10,103 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 00:34:10,103 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:34:10,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 00:34:10,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:34:10,104 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 5 states. [2021-10-11 00:34:10,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:34:10,262 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2021-10-11 00:34:10,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 00:34:10,263 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2021-10-11 00:34:10,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:34:10,264 INFO L225 Difference]: With dead ends: 117 [2021-10-11 00:34:10,264 INFO L226 Difference]: Without dead ends: 115 [2021-10-11 00:34:10,265 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-11 00:34:10,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-10-11 00:34:10,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 73. [2021-10-11 00:34:10,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2021-10-11 00:34:10,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2021-10-11 00:34:10,279 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 23 [2021-10-11 00:34:10,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:34:10,281 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2021-10-11 00:34:10,281 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 00:34:10,282 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2021-10-11 00:34:10,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-11 00:34:10,284 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:34:10,284 INFO L422 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] [2021-10-11 00:34:10,285 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-11 00:34:10,285 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:34:10,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:34:10,286 INFO L82 PathProgramCache]: Analyzing trace with hash 977084131, now seen corresponding path program 1 times [2021-10-11 00:34:10,286 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:34:10,286 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048036841] [2021-10-11 00:34:10,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:34:10,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:34:10,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:34:10,373 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048036841] [2021-10-11 00:34:10,373 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:34:10,373 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 00:34:10,374 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152911807] [2021-10-11 00:34:10,375 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 00:34:10,375 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:34:10,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 00:34:10,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:34:10,377 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand 5 states. [2021-10-11 00:34:10,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:34:10,469 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2021-10-11 00:34:10,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 00:34:10,470 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2021-10-11 00:34:10,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:34:10,472 INFO L225 Difference]: With dead ends: 73 [2021-10-11 00:34:10,472 INFO L226 Difference]: Without dead ends: 71 [2021-10-11 00:34:10,472 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-11 00:34:10,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-10-11 00:34:10,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2021-10-11 00:34:10,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2021-10-11 00:34:10,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2021-10-11 00:34:10,478 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 23 [2021-10-11 00:34:10,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:34:10,478 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2021-10-11 00:34:10,479 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 00:34:10,479 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2021-10-11 00:34:10,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-11 00:34:10,481 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:34:10,481 INFO L422 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] [2021-10-11 00:34:10,481 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-11 00:34:10,482 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:34:10,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:34:10,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1619855478, now seen corresponding path program 1 times [2021-10-11 00:34:10,483 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:34:10,484 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373276648] [2021-10-11 00:34:10,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:34:10,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:34:10,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:34:10,537 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373276648] [2021-10-11 00:34:10,541 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:34:10,542 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:34:10,542 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77555957] [2021-10-11 00:34:10,542 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 00:34:10,542 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:34:10,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:34:10,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:34:10,543 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand 3 states. [2021-10-11 00:34:10,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:34:10,583 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2021-10-11 00:34:10,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:34:10,584 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2021-10-11 00:34:10,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:34:10,586 INFO L225 Difference]: With dead ends: 111 [2021-10-11 00:34:10,587 INFO L226 Difference]: Without dead ends: 71 [2021-10-11 00:34:10,587 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:34:10,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-10-11 00:34:10,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2021-10-11 00:34:10,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2021-10-11 00:34:10,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2021-10-11 00:34:10,592 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 25 [2021-10-11 00:34:10,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:34:10,592 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2021-10-11 00:34:10,592 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 00:34:10,592 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2021-10-11 00:34:10,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-11 00:34:10,600 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:34:10,600 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:34:10,600 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-11 00:34:10,601 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:34:10,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:34:10,602 INFO L82 PathProgramCache]: Analyzing trace with hash 595608307, now seen corresponding path program 1 times [2021-10-11 00:34:10,603 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:34:10,603 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030910298] [2021-10-11 00:34:10,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:34:10,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:34:10,686 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-11 00:34:10,686 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030910298] [2021-10-11 00:34:10,687 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229027699] [2021-10-11 00:34:10,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f29f5fb0-698a-4d77-a57e-d6a83d418d30/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 00:34:10,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:34:10,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2021-10-11 00:34:10,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 00:34:10,885 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-11 00:34:10,886 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-11 00:34:10,886 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-10-11 00:34:10,886 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616401299] [2021-10-11 00:34:10,887 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 00:34:10,887 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:34:10,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 00:34:10,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-11 00:34:10,887 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand 6 states. [2021-10-11 00:34:10,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:34:10,977 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2021-10-11 00:34:10,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 00:34:10,978 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2021-10-11 00:34:10,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:34:10,979 INFO L225 Difference]: With dead ends: 111 [2021-10-11 00:34:10,979 INFO L226 Difference]: Without dead ends: 109 [2021-10-11 00:34:10,979 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-10-11 00:34:10,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-10-11 00:34:10,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 68. [2021-10-11 00:34:10,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2021-10-11 00:34:10,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2021-10-11 00:34:10,986 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 26 [2021-10-11 00:34:10,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:34:10,988 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2021-10-11 00:34:10,988 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 00:34:10,988 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2021-10-11 00:34:10,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-11 00:34:10,988 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:34:10,989 INFO L422 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] [2021-10-11 00:34:11,202 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-10-11 00:34:11,202 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:34:11,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:34:11,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1780382557, now seen corresponding path program 1 times [2021-10-11 00:34:11,203 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:34:11,203 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079329585] [2021-10-11 00:34:11,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:34:11,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:34:11,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:34:11,246 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079329585] [2021-10-11 00:34:11,246 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:34:11,246 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 00:34:11,246 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194572220] [2021-10-11 00:34:11,247 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 00:34:11,247 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:34:11,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 00:34:11,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:34:11,248 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 5 states. [2021-10-11 00:34:11,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:34:11,305 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2021-10-11 00:34:11,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 00:34:11,306 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2021-10-11 00:34:11,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:34:11,307 INFO L225 Difference]: With dead ends: 69 [2021-10-11 00:34:11,307 INFO L226 Difference]: Without dead ends: 67 [2021-10-11 00:34:11,307 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-10-11 00:34:11,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-10-11 00:34:11,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2021-10-11 00:34:11,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2021-10-11 00:34:11,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2021-10-11 00:34:11,311 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 26 [2021-10-11 00:34:11,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:34:11,311 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2021-10-11 00:34:11,312 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 00:34:11,312 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2021-10-11 00:34:11,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-11 00:34:11,312 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:34:11,312 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:34:11,312 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-11 00:34:11,313 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:34:11,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:34:11,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1280139623, now seen corresponding path program 1 times [2021-10-11 00:34:11,313 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:34:11,313 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081522421] [2021-10-11 00:34:11,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:34:11,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:34:11,354 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-11 00:34:11,354 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081522421] [2021-10-11 00:34:11,355 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960541874] [2021-10-11 00:34:11,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f29f5fb0-698a-4d77-a57e-d6a83d418d30/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 00:34:11,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:34:11,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 19 conjunts are in the unsatisfiable core [2021-10-11 00:34:11,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 00:34:11,531 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:34:11,531 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-11 00:34:11,531 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8] total 11 [2021-10-11 00:34:11,531 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879542467] [2021-10-11 00:34:11,532 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-10-11 00:34:11,532 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:34:11,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-11 00:34:11,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-10-11 00:34:11,533 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand 11 states. [2021-10-11 00:34:11,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:34:11,690 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2021-10-11 00:34:11,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-11 00:34:11,691 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2021-10-11 00:34:11,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:34:11,692 INFO L225 Difference]: With dead ends: 67 [2021-10-11 00:34:11,692 INFO L226 Difference]: Without dead ends: 65 [2021-10-11 00:34:11,693 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2021-10-11 00:34:11,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-10-11 00:34:11,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2021-10-11 00:34:11,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2021-10-11 00:34:11,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2021-10-11 00:34:11,697 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 27 [2021-10-11 00:34:11,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:34:11,697 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2021-10-11 00:34:11,697 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-10-11 00:34:11,697 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2021-10-11 00:34:11,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-11 00:34:11,699 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:34:11,700 INFO L422 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] [2021-10-11 00:34:11,914 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-10-11 00:34:11,914 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:34:11,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:34:11,915 INFO L82 PathProgramCache]: Analyzing trace with hash -642711428, now seen corresponding path program 1 times [2021-10-11 00:34:11,915 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:34:11,915 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340428928] [2021-10-11 00:34:11,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:34:11,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:34:11,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:34:11,952 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340428928] [2021-10-11 00:34:11,953 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:34:11,953 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 00:34:11,953 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165508281] [2021-10-11 00:34:11,953 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 00:34:11,953 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:34:11,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 00:34:11,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:34:11,954 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 5 states. [2021-10-11 00:34:12,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:34:12,005 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2021-10-11 00:34:12,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 00:34:12,006 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2021-10-11 00:34:12,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:34:12,006 INFO L225 Difference]: With dead ends: 60 [2021-10-11 00:34:12,006 INFO L226 Difference]: Without dead ends: 58 [2021-10-11 00:34:12,007 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-11 00:34:12,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2021-10-11 00:34:12,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2021-10-11 00:34:12,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2021-10-11 00:34:12,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2021-10-11 00:34:12,011 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 27 [2021-10-11 00:34:12,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:34:12,012 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2021-10-11 00:34:12,012 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 00:34:12,012 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2021-10-11 00:34:12,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-10-11 00:34:12,013 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:34:12,013 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:34:12,013 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-11 00:34:12,013 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:34:12,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:34:12,014 INFO L82 PathProgramCache]: Analyzing trace with hash -47880409, now seen corresponding path program 1 times [2021-10-11 00:34:12,014 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:34:12,014 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759106829] [2021-10-11 00:34:12,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:34:12,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:34:12,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:34:12,071 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759106829] [2021-10-11 00:34:12,071 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:34:12,072 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 00:34:12,074 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875730085] [2021-10-11 00:34:12,074 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 00:34:12,074 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:34:12,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 00:34:12,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:34:12,075 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 5 states. [2021-10-11 00:34:12,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:34:12,127 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2021-10-11 00:34:12,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 00:34:12,127 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2021-10-11 00:34:12,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:34:12,128 INFO L225 Difference]: With dead ends: 59 [2021-10-11 00:34:12,128 INFO L226 Difference]: Without dead ends: 57 [2021-10-11 00:34:12,128 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-10-11 00:34:12,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-10-11 00:34:12,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2021-10-11 00:34:12,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2021-10-11 00:34:12,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2021-10-11 00:34:12,131 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 30 [2021-10-11 00:34:12,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:34:12,131 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2021-10-11 00:34:12,132 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 00:34:12,132 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2021-10-11 00:34:12,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-10-11 00:34:12,132 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:34:12,133 INFO L422 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] [2021-10-11 00:34:12,133 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-11 00:34:12,134 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:34:12,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:34:12,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1484288504, now seen corresponding path program 1 times [2021-10-11 00:34:12,135 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:34:12,135 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011210577] [2021-10-11 00:34:12,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:34:12,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:34:12,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:34:12,186 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011210577] [2021-10-11 00:34:12,190 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:34:12,190 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-11 00:34:12,190 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711189259] [2021-10-11 00:34:12,191 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 00:34:12,191 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:34:12,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 00:34:12,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-10-11 00:34:12,192 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 6 states. [2021-10-11 00:34:12,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:34:12,295 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2021-10-11 00:34:12,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 00:34:12,295 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2021-10-11 00:34:12,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:34:12,296 INFO L225 Difference]: With dead ends: 67 [2021-10-11 00:34:12,296 INFO L226 Difference]: Without dead ends: 65 [2021-10-11 00:34:12,297 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-10-11 00:34:12,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-10-11 00:34:12,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 54. [2021-10-11 00:34:12,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2021-10-11 00:34:12,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2021-10-11 00:34:12,300 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 31 [2021-10-11 00:34:12,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:34:12,301 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2021-10-11 00:34:12,301 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 00:34:12,301 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2021-10-11 00:34:12,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-10-11 00:34:12,301 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:34:12,301 INFO L422 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] [2021-10-11 00:34:12,302 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-11 00:34:12,302 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:34:12,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:34:12,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1746453711, now seen corresponding path program 1 times [2021-10-11 00:34:12,303 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:34:12,303 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086185952] [2021-10-11 00:34:12,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:34:12,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:34:12,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:34:12,342 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086185952] [2021-10-11 00:34:12,342 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:34:12,342 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 00:34:12,343 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874467312] [2021-10-11 00:34:12,343 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 00:34:12,343 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:34:12,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 00:34:12,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:34:12,344 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand 5 states. [2021-10-11 00:34:12,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:34:12,441 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2021-10-11 00:34:12,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-11 00:34:12,442 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2021-10-11 00:34:12,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:34:12,442 INFO L225 Difference]: With dead ends: 87 [2021-10-11 00:34:12,442 INFO L226 Difference]: Without dead ends: 85 [2021-10-11 00:34:12,443 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-11 00:34:12,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-10-11 00:34:12,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 57. [2021-10-11 00:34:12,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2021-10-11 00:34:12,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2021-10-11 00:34:12,448 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 34 [2021-10-11 00:34:12,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:34:12,448 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2021-10-11 00:34:12,448 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 00:34:12,448 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2021-10-11 00:34:12,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-10-11 00:34:12,448 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:34:12,448 INFO L422 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] [2021-10-11 00:34:12,449 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-11 00:34:12,449 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:34:12,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:34:12,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1694514003, now seen corresponding path program 1 times [2021-10-11 00:34:12,449 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:34:12,451 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293812400] [2021-10-11 00:34:12,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:34:12,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:34:12,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:34:12,503 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293812400] [2021-10-11 00:34:12,503 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:34:12,503 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 00:34:12,503 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490723531] [2021-10-11 00:34:12,504 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 00:34:12,504 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:34:12,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 00:34:12,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:34:12,505 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 5 states. [2021-10-11 00:34:12,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:34:12,577 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2021-10-11 00:34:12,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 00:34:12,577 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2021-10-11 00:34:12,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:34:12,578 INFO L225 Difference]: With dead ends: 57 [2021-10-11 00:34:12,578 INFO L226 Difference]: Without dead ends: 55 [2021-10-11 00:34:12,579 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-11 00:34:12,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-10-11 00:34:12,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2021-10-11 00:34:12,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2021-10-11 00:34:12,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2021-10-11 00:34:12,591 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 35 [2021-10-11 00:34:12,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:34:12,591 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2021-10-11 00:34:12,591 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 00:34:12,592 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2021-10-11 00:34:12,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-11 00:34:12,592 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:34:12,592 INFO L422 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] [2021-10-11 00:34:12,592 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-11 00:34:12,593 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:34:12,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:34:12,594 INFO L82 PathProgramCache]: Analyzing trace with hash 635482230, now seen corresponding path program 1 times [2021-10-11 00:34:12,594 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:34:12,594 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537405265] [2021-10-11 00:34:12,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:34:12,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:34:12,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:34:12,640 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537405265] [2021-10-11 00:34:12,640 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:34:12,640 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 00:34:12,642 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334623223] [2021-10-11 00:34:12,642 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 00:34:12,642 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:34:12,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 00:34:12,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 00:34:12,643 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 4 states. [2021-10-11 00:34:12,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:34:12,667 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2021-10-11 00:34:12,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 00:34:12,668 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2021-10-11 00:34:12,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:34:12,668 INFO L225 Difference]: With dead ends: 66 [2021-10-11 00:34:12,668 INFO L226 Difference]: Without dead ends: 64 [2021-10-11 00:34:12,669 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:34:12,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-10-11 00:34:12,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 53. [2021-10-11 00:34:12,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2021-10-11 00:34:12,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2021-10-11 00:34:12,673 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 37 [2021-10-11 00:34:12,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:34:12,673 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2021-10-11 00:34:12,673 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 00:34:12,673 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2021-10-11 00:34:12,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-11 00:34:12,674 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:34:12,674 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:34:12,674 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-11 00:34:12,674 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:34:12,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:34:12,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1774883137, now seen corresponding path program 1 times [2021-10-11 00:34:12,675 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:34:12,675 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458392547] [2021-10-11 00:34:12,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:34:12,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:34:12,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:34:12,724 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458392547] [2021-10-11 00:34:12,724 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:34:12,724 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 00:34:12,725 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773194153] [2021-10-11 00:34:12,726 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 00:34:12,726 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:34:12,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 00:34:12,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:34:12,727 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 5 states. [2021-10-11 00:34:12,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:34:12,753 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2021-10-11 00:34:12,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 00:34:12,754 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2021-10-11 00:34:12,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:34:12,754 INFO L225 Difference]: With dead ends: 62 [2021-10-11 00:34:12,755 INFO L226 Difference]: Without dead ends: 60 [2021-10-11 00:34:12,757 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-11 00:34:12,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-10-11 00:34:12,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 51. [2021-10-11 00:34:12,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2021-10-11 00:34:12,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2021-10-11 00:34:12,767 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 38 [2021-10-11 00:34:12,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:34:12,768 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2021-10-11 00:34:12,768 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 00:34:12,768 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2021-10-11 00:34:12,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-11 00:34:12,768 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:34:12,768 INFO L422 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] [2021-10-11 00:34:12,768 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-11 00:34:12,769 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:34:12,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:34:12,769 INFO L82 PathProgramCache]: Analyzing trace with hash 813201821, now seen corresponding path program 1 times [2021-10-11 00:34:12,769 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:34:12,769 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952612955] [2021-10-11 00:34:12,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:34:12,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:34:12,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:34:12,849 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952612955] [2021-10-11 00:34:12,850 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:34:12,850 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 00:34:12,850 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114494032] [2021-10-11 00:34:12,850 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 00:34:12,851 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:34:12,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 00:34:12,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:34:12,852 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand 5 states. [2021-10-11 00:34:12,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:34:12,980 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2021-10-11 00:34:12,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-11 00:34:12,980 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2021-10-11 00:34:12,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:34:12,983 INFO L225 Difference]: With dead ends: 84 [2021-10-11 00:34:12,983 INFO L226 Difference]: Without dead ends: 82 [2021-10-11 00:34:12,984 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-11 00:34:12,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-10-11 00:34:12,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 56. [2021-10-11 00:34:12,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2021-10-11 00:34:12,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2021-10-11 00:34:12,989 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 39 [2021-10-11 00:34:12,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:34:12,989 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2021-10-11 00:34:12,989 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 00:34:12,989 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2021-10-11 00:34:12,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-11 00:34:12,990 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:34:12,990 INFO L422 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] [2021-10-11 00:34:12,990 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-11 00:34:12,990 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:34:12,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:34:12,991 INFO L82 PathProgramCache]: Analyzing trace with hash -560543098, now seen corresponding path program 1 times [2021-10-11 00:34:12,991 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:34:12,991 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204787731] [2021-10-11 00:34:12,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:34:13,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:34:13,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:34:13,059 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204787731] [2021-10-11 00:34:13,059 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:34:13,059 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 00:34:13,060 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444460725] [2021-10-11 00:34:13,061 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 00:34:13,061 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:34:13,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 00:34:13,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:34:13,062 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 5 states. [2021-10-11 00:34:13,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:34:13,142 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2021-10-11 00:34:13,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 00:34:13,143 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2021-10-11 00:34:13,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:34:13,143 INFO L225 Difference]: With dead ends: 69 [2021-10-11 00:34:13,143 INFO L226 Difference]: Without dead ends: 67 [2021-10-11 00:34:13,144 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-11 00:34:13,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-10-11 00:34:13,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 54. [2021-10-11 00:34:13,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2021-10-11 00:34:13,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2021-10-11 00:34:13,148 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 40 [2021-10-11 00:34:13,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:34:13,148 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2021-10-11 00:34:13,148 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 00:34:13,148 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2021-10-11 00:34:13,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-11 00:34:13,149 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:34:13,149 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:34:13,149 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-11 00:34:13,150 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:34:13,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:34:13,151 INFO L82 PathProgramCache]: Analyzing trace with hash 375780089, now seen corresponding path program 1 times [2021-10-11 00:34:13,151 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:34:13,151 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757707622] [2021-10-11 00:34:13,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:34:13,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:34:13,216 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:34:13,216 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757707622] [2021-10-11 00:34:13,216 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723016904] [2021-10-11 00:34:13,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f29f5fb0-698a-4d77-a57e-d6a83d418d30/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 00:34:13,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:34:13,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 11 conjunts are in the unsatisfiable core [2021-10-11 00:34:13,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 00:34:13,376 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:34:13,376 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-11 00:34:13,376 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 7 [2021-10-11 00:34:13,376 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038820845] [2021-10-11 00:34:13,377 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-10-11 00:34:13,377 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:34:13,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-11 00:34:13,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-10-11 00:34:13,378 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 7 states. [2021-10-11 00:34:13,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:34:13,493 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2021-10-11 00:34:13,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-11 00:34:13,498 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2021-10-11 00:34:13,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:34:13,499 INFO L225 Difference]: With dead ends: 56 [2021-10-11 00:34:13,499 INFO L226 Difference]: Without dead ends: 54 [2021-10-11 00:34:13,500 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-10-11 00:34:13,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2021-10-11 00:34:13,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2021-10-11 00:34:13,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2021-10-11 00:34:13,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2021-10-11 00:34:13,504 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 40 [2021-10-11 00:34:13,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:34:13,505 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2021-10-11 00:34:13,505 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-10-11 00:34:13,505 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2021-10-11 00:34:13,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-10-11 00:34:13,505 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:34:13,506 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:34:13,722 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-10-11 00:34:13,722 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:34:13,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:34:13,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1394778411, now seen corresponding path program 1 times [2021-10-11 00:34:13,723 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:34:13,723 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811271320] [2021-10-11 00:34:13,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:34:13,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:34:13,764 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-11 00:34:13,764 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811271320] [2021-10-11 00:34:13,764 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:34:13,765 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 00:34:13,765 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178865358] [2021-10-11 00:34:13,765 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 00:34:13,765 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:34:13,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 00:34:13,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:34:13,766 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 5 states. [2021-10-11 00:34:13,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:34:13,871 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2021-10-11 00:34:13,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-11 00:34:13,872 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2021-10-11 00:34:13,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:34:13,872 INFO L225 Difference]: With dead ends: 71 [2021-10-11 00:34:13,872 INFO L226 Difference]: Without dead ends: 0 [2021-10-11 00:34:13,874 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-10-11 00:34:13,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-11 00:34:13,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-11 00:34:13,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-10-11 00:34:13,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-11 00:34:13,875 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2021-10-11 00:34:13,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:34:13,875 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-11 00:34:13,875 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 00:34:13,875 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-11 00:34:13,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-11 00:34:13,876 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-11 00:34:13,877 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-11 00:34:14,258 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 29 [2021-10-11 00:34:14,622 WARN L197 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 63 [2021-10-11 00:34:14,727 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 27 [2021-10-11 00:34:15,036 WARN L197 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 70 [2021-10-11 00:34:15,041 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 97) no Hoare annotation was computed. [2021-10-11 00:34:15,041 INFO L262 CegarLoopResult]: For program point L85(line 85) no Hoare annotation was computed. [2021-10-11 00:34:15,041 INFO L262 CegarLoopResult]: For program point L234(lines 234 338) no Hoare annotation was computed. [2021-10-11 00:34:15,042 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 272) no Hoare annotation was computed. [2021-10-11 00:34:15,042 INFO L262 CegarLoopResult]: For program point L135(lines 135 397) no Hoare annotation was computed. [2021-10-11 00:34:15,042 INFO L262 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-10-11 00:34:15,042 INFO L262 CegarLoopResult]: For program point L284(line 284) no Hoare annotation was computed. [2021-10-11 00:34:15,042 INFO L262 CegarLoopResult]: For program point L53(lines 53 433) no Hoare annotation was computed. [2021-10-11 00:34:15,042 INFO L262 CegarLoopResult]: For program point L384(lines 384 393) no Hoare annotation was computed. [2021-10-11 00:34:15,042 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 255) no Hoare annotation was computed. [2021-10-11 00:34:15,043 INFO L258 CegarLoopResult]: At program point L401(lines 131 402) the Hoare annotation is: (and (< ULTIMATE.start_main_~main__cp~0 ULTIMATE.start_main_~main__urilen~0) (= ULTIMATE.start_main_~__VERIFIER_assert__cond~3 1) (let ((.cse0 (<= 1 ULTIMATE.start_main_~main__cp~0)) (.cse1 (< 0 ULTIMATE.start_main_~main__scheme~0)) (.cse2 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~0 0))) (.cse3 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~1 0)))) (or (and .cse0 (= ULTIMATE.start_main_~__VERIFIER_assert__cond~2 1) .cse1 .cse2 .cse3) (and .cse0 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~16 0)) .cse1 .cse2 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~2 0)) .cse3)))) [2021-10-11 00:34:15,043 INFO L262 CegarLoopResult]: For program point L104(lines 104 411) no Hoare annotation was computed. [2021-10-11 00:34:15,043 INFO L262 CegarLoopResult]: For program point L71(lines 71 416) no Hoare annotation was computed. [2021-10-11 00:34:15,043 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 177) no Hoare annotation was computed. [2021-10-11 00:34:15,043 INFO L262 CegarLoopResult]: For program point L253(lines 253 329) no Hoare annotation was computed. [2021-10-11 00:34:15,044 INFO L262 CegarLoopResult]: For program point L187(lines 187 355) no Hoare annotation was computed. [2021-10-11 00:34:15,044 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION(line 386) no Hoare annotation was computed. [2021-10-11 00:34:15,044 INFO L262 CegarLoopResult]: For program point L270(lines 270 322) no Hoare annotation was computed. [2021-10-11 00:34:15,044 INFO L262 CegarLoopResult]: For program point L204(lines 204 353) no Hoare annotation was computed. [2021-10-11 00:34:15,044 INFO L262 CegarLoopResult]: For program point L386(line 386) no Hoare annotation was computed. [2021-10-11 00:34:15,044 INFO L262 CegarLoopResult]: For program point L155(lines 155 360) no Hoare annotation was computed. [2021-10-11 00:34:15,044 INFO L262 CegarLoopResult]: For program point L23(lines 23 438) no Hoare annotation was computed. [2021-10-11 00:34:15,045 INFO L262 CegarLoopResult]: For program point L255(line 255) no Hoare annotation was computed. [2021-10-11 00:34:15,045 INFO L262 CegarLoopResult]: For program point L189(line 189) no Hoare annotation was computed. [2021-10-11 00:34:15,045 INFO L262 CegarLoopResult]: For program point L123(lines 123 403) no Hoare annotation was computed. [2021-10-11 00:34:15,045 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 214) no Hoare annotation was computed. [2021-10-11 00:34:15,045 INFO L262 CegarLoopResult]: For program point L272(line 272) no Hoare annotation was computed. [2021-10-11 00:34:15,045 INFO L262 CegarLoopResult]: For program point L41(lines 41 435) no Hoare annotation was computed. [2021-10-11 00:34:15,045 INFO L262 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-11 00:34:15,046 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 189) no Hoare annotation was computed. [2021-10-11 00:34:15,046 INFO L262 CegarLoopResult]: For program point L157(line 157) no Hoare annotation was computed. [2021-10-11 00:34:15,046 INFO L262 CegarLoopResult]: For program point L372(lines 372 395) no Hoare annotation was computed. [2021-10-11 00:34:15,046 INFO L262 CegarLoopResult]: For program point L306(lines 306 316) no Hoare annotation was computed. [2021-10-11 00:34:15,046 INFO L262 CegarLoopResult]: For program point L224(lines 224 344) no Hoare annotation was computed. [2021-10-11 00:34:15,046 INFO L262 CegarLoopResult]: For program point L125(line 125) no Hoare annotation was computed. [2021-10-11 00:34:15,046 INFO L262 CegarLoopResult]: For program point L59(lines 59 432) no Hoare annotation was computed. [2021-10-11 00:34:15,046 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 113) no Hoare annotation was computed. [2021-10-11 00:34:15,047 INFO L262 CegarLoopResult]: For program point L241(lines 241 331) no Hoare annotation was computed. [2021-10-11 00:34:15,047 INFO L262 CegarLoopResult]: For program point L175(lines 175 357) no Hoare annotation was computed. [2021-10-11 00:34:15,047 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 284) no Hoare annotation was computed. [2021-10-11 00:34:15,047 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 226) no Hoare annotation was computed. [2021-10-11 00:34:15,047 INFO L262 CegarLoopResult]: For program point L374(line 374) no Hoare annotation was computed. [2021-10-11 00:34:15,047 INFO L262 CegarLoopResult]: For program point L308(line 308) no Hoare annotation was computed. [2021-10-11 00:34:15,047 INFO L262 CegarLoopResult]: For program point L143(lines 143 362) no Hoare annotation was computed. [2021-10-11 00:34:15,048 INFO L262 CegarLoopResult]: For program point L226(line 226) no Hoare annotation was computed. [2021-10-11 00:34:15,048 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 145) no Hoare annotation was computed. [2021-10-11 00:34:15,048 INFO L262 CegarLoopResult]: For program point L61(lines 61 427) no Hoare annotation was computed. [2021-10-11 00:34:15,048 INFO L262 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-10-11 00:34:15,048 INFO L262 CegarLoopResult]: For program point L243(line 243) no Hoare annotation was computed. [2021-10-11 00:34:15,048 INFO L262 CegarLoopResult]: For program point L177(line 177) no Hoare annotation was computed. [2021-10-11 00:34:15,048 INFO L262 CegarLoopResult]: For program point L111(lines 111 405) no Hoare annotation was computed. [2021-10-11 00:34:15,048 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 308) no Hoare annotation was computed. [2021-10-11 00:34:15,049 INFO L258 CegarLoopResult]: At program point L392(lines 129 403) the Hoare annotation is: (and (let ((.cse0 (<= 1 ULTIMATE.start_main_~main__cp~0)) (.cse1 (< 0 ULTIMATE.start_main_~main__scheme~0)) (.cse2 (= ULTIMATE.start_main_~__VERIFIER_assert__cond~3 1)) (.cse3 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~0 0))) (.cse4 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~1 0)))) (or (and .cse0 .cse1 .cse2 .cse3 (<= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~16) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~2 0)) .cse4 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~17 0))) (and .cse0 (= ULTIMATE.start_main_~__VERIFIER_assert__cond~2 1) .cse1 .cse2 .cse3 .cse4))) (< ULTIMATE.start_main_~main__cp~0 ULTIMATE.start_main_~main__urilen~0)) [2021-10-11 00:34:15,049 INFO L262 CegarLoopResult]: For program point L194(lines 194 354) no Hoare annotation was computed. [2021-10-11 00:34:15,049 INFO L262 CegarLoopResult]: For program point L95(lines 95 412) no Hoare annotation was computed. [2021-10-11 00:34:15,049 INFO L262 CegarLoopResult]: For program point L29(lines 29 437) no Hoare annotation was computed. [2021-10-11 00:34:15,049 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 125) no Hoare annotation was computed. [2021-10-11 00:34:15,049 INFO L262 CegarLoopResult]: For program point L145(line 145) no Hoare annotation was computed. [2021-10-11 00:34:15,050 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 296) no Hoare annotation was computed. [2021-10-11 00:34:15,050 INFO L258 CegarLoopResult]: At program point L327(lines 262 328) the Hoare annotation is: (and (let ((.cse0 (let ((.cse1 (<= 1 ULTIMATE.start_main_~main__cp~0)) (.cse2 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~7 0))) (.cse3 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~6 0))) (.cse4 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~11 0))) (.cse5 (< 0 ULTIMATE.start_main_~main__scheme~0)) (.cse6 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~5 0))) (.cse7 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~2 0))) (.cse8 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~8 0))) (.cse9 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~0 0))) (.cse10 (= ULTIMATE.start_main_~__VERIFIER_assert__cond~3 1)) (.cse11 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~1 0))) (.cse12 (= ULTIMATE.start_main_~__VERIFIER_assert__cond~4 1))) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= (+ ULTIMATE.start_main_~main__c~0 2) ULTIMATE.start_main_~main__tokenlen~0) .cse9 .cse10 .cse11 .cse12) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~12 0)) .cse9 .cse10 .cse11 .cse12))))) (or (and (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~13 0)) (<= 1 ULTIMATE.start_main_~main__c~0) .cse0) (and .cse0 (= ULTIMATE.start_main_~main__c~0 0)))) (= ULTIMATE.start_main_~__VERIFIER_assert__cond~9 1) (< (+ ULTIMATE.start_main_~main__cp~0 1) ULTIMATE.start_main_~main__urilen~0) (= ULTIMATE.start_main_~__VERIFIER_assert__cond~10 1)) [2021-10-11 00:34:15,050 INFO L262 CegarLoopResult]: For program point L294(lines 294 318) no Hoare annotation was computed. [2021-10-11 00:34:15,050 INFO L262 CegarLoopResult]: For program point L162(lines 162 359) no Hoare annotation was computed. [2021-10-11 00:34:15,051 INFO L262 CegarLoopResult]: For program point L63(lines 63 422) no Hoare annotation was computed. [2021-10-11 00:34:15,051 INFO L258 CegarLoopResult]: At program point L410(lines 104 411) the Hoare annotation is: (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~0 0)) [2021-10-11 00:34:15,051 INFO L262 CegarLoopResult]: For program point L212(lines 212 346) no Hoare annotation was computed. [2021-10-11 00:34:15,051 INFO L262 CegarLoopResult]: For program point L113(line 113) no Hoare annotation was computed. [2021-10-11 00:34:15,051 INFO L262 CegarLoopResult]: For program point L47(lines 47 434) no Hoare annotation was computed. [2021-10-11 00:34:15,051 INFO L262 CegarLoopResult]: For program point L262(lines 262 328) no Hoare annotation was computed. [2021-10-11 00:34:15,051 INFO L262 CegarLoopResult]: For program point L97(line 97) no Hoare annotation was computed. [2021-10-11 00:34:15,052 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 157) no Hoare annotation was computed. [2021-10-11 00:34:15,052 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 374) no Hoare annotation was computed. [2021-10-11 00:34:15,052 INFO L262 CegarLoopResult]: For program point L296(line 296) no Hoare annotation was computed. [2021-10-11 00:34:15,052 INFO L262 CegarLoopResult]: For program point L65(lines 65 417) no Hoare annotation was computed. [2021-10-11 00:34:15,052 INFO L262 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2021-10-11 00:34:15,052 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 85) no Hoare annotation was computed. [2021-10-11 00:34:15,052 INFO L262 CegarLoopResult]: For program point L214(line 214) no Hoare annotation was computed. [2021-10-11 00:34:15,052 INFO L262 CegarLoopResult]: For program point L83(lines 83 414) no Hoare annotation was computed. [2021-10-11 00:34:15,053 INFO L258 CegarLoopResult]: At program point L315(lines 230 344) the Hoare annotation is: (let ((.cse2 (<= 1 ULTIMATE.start_main_~main__cp~0)) (.cse3 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~7 0))) (.cse4 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~6 0))) (.cse6 (< 0 ULTIMATE.start_main_~main__scheme~0)) (.cse7 (< ULTIMATE.start_main_~main__cp~0 ULTIMATE.start_main_~main__urilen~0)) (.cse8 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~5 0))) (.cse9 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~2 0))) (.cse10 (= ULTIMATE.start_main_~__VERIFIER_assert__cond~9 1)) (.cse12 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~8 0))) (.cse13 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~0 0))) (.cse14 (= ULTIMATE.start_main_~__VERIFIER_assert__cond~3 1)) (.cse15 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~1 0))) (.cse16 (= ULTIMATE.start_main_~__VERIFIER_assert__cond~4 1)) (.cse1 (= ULTIMATE.start_main_~main__c~0 0))) (or (and (<= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~10) (let ((.cse0 (let ((.cse5 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~11 0))) (.cse11 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~10 0)))) (or (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~12 0)) .cse13 .cse14 .cse15 .cse16) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= (+ ULTIMATE.start_main_~main__c~0 2) ULTIMATE.start_main_~main__tokenlen~0) .cse13 .cse14 .cse15 .cse16))))) (or (and (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~13 0)) (<= 1 ULTIMATE.start_main_~main__c~0) .cse0) (and .cse0 .cse1)))) (and .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 (= ULTIMATE.start_main_~__VERIFIER_assert__cond~8 1) .cse12 (= ULTIMATE.start_main_~__VERIFIER_assert__cond~6 1) .cse13 .cse14 .cse15 (< (+ ULTIMATE.start_main_~main__cp~0 1) ULTIMATE.start_main_~main__urilen~0) .cse16 .cse1))) [2021-10-11 00:34:15,053 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 243) no Hoare annotation was computed. [2021-10-11 00:34:15,053 INFO L262 CegarLoopResult]: For program point L282(lines 282 320) no Hoare annotation was computed. [2021-10-11 00:34:15,053 INFO L265 CegarLoopResult]: At program point L431(lines 13 439) the Hoare annotation is: true [2021-10-11 00:34:15,053 INFO L262 CegarLoopResult]: For program point L35(lines 35 436) no Hoare annotation was computed. [2021-10-11 00:34:15,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 12:34:15 BoogieIcfgContainer [2021-10-11 00:34:15,080 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-11 00:34:15,081 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-11 00:34:15,081 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-11 00:34:15,081 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-11 00:34:15,081 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:34:08" (3/4) ... [2021-10-11 00:34:15,084 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-11 00:34:15,098 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-10-11 00:34:15,099 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-10-11 00:34:15,100 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-11 00:34:15,100 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-11 00:34:15,163 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f29f5fb0-698a-4d77-a57e-d6a83d418d30/bin/uautomizer-Z5i5R5N3CC/witness.graphml [2021-10-11 00:34:15,163 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-11 00:34:15,164 INFO L168 Benchmark]: Toolchain (without parser) took 8122.82 ms. Allocated memory was 134.2 MB in the beginning and 195.0 MB in the end (delta: 60.8 MB). Free memory was 101.0 MB in the beginning and 132.8 MB in the end (delta: -31.7 MB). Peak memory consumption was 28.2 MB. Max. memory is 16.1 GB. [2021-10-11 00:34:15,164 INFO L168 Benchmark]: CDTParser took 0.88 ms. Allocated memory is still 88.1 MB. Free memory was 45.3 MB in the beginning and 45.3 MB in the end (delta: 76.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 00:34:15,165 INFO L168 Benchmark]: CACSL2BoogieTranslator took 425.91 ms. Allocated memory is still 134.2 MB. Free memory was 100.7 MB in the beginning and 101.2 MB in the end (delta: -489.5 kB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-11 00:34:15,165 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.60 ms. Allocated memory is still 134.2 MB. Free memory was 101.2 MB in the beginning and 99.1 MB in the end (delta: 2.1 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 00:34:15,166 INFO L168 Benchmark]: Boogie Preprocessor took 27.49 ms. Allocated memory is still 134.2 MB. Free memory was 99.1 MB in the beginning and 97.9 MB in the end (delta: 1.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-11 00:34:15,166 INFO L168 Benchmark]: RCFGBuilder took 647.97 ms. Allocated memory is still 134.2 MB. Free memory was 97.5 MB in the beginning and 69.7 MB in the end (delta: 27.8 MB). Peak memory consumption was 27.3 MB. Max. memory is 16.1 GB. [2021-10-11 00:34:15,166 INFO L168 Benchmark]: TraceAbstraction took 6879.51 ms. Allocated memory was 134.2 MB in the beginning and 195.0 MB in the end (delta: 60.8 MB). Free memory was 69.3 MB in the beginning and 139.1 MB in the end (delta: -69.8 MB). Peak memory consumption was 73.2 MB. Max. memory is 16.1 GB. [2021-10-11 00:34:15,167 INFO L168 Benchmark]: Witness Printer took 82.55 ms. Allocated memory is still 195.0 MB. Free memory was 139.1 MB in the beginning and 132.8 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-10-11 00:34:15,169 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.88 ms. Allocated memory is still 88.1 MB. Free memory was 45.3 MB in the beginning and 45.3 MB in the end (delta: 76.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 425.91 ms. Allocated memory is still 134.2 MB. Free memory was 100.7 MB in the beginning and 101.2 MB in the end (delta: -489.5 kB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 44.60 ms. Allocated memory is still 134.2 MB. Free memory was 101.2 MB in the beginning and 99.1 MB in the end (delta: 2.1 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 27.49 ms. Allocated memory is still 134.2 MB. Free memory was 99.1 MB in the beginning and 97.9 MB in the end (delta: 1.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 647.97 ms. Allocated memory is still 134.2 MB. Free memory was 97.5 MB in the beginning and 69.7 MB in the end (delta: 27.8 MB). Peak memory consumption was 27.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 6879.51 ms. Allocated memory was 134.2 MB in the beginning and 195.0 MB in the end (delta: 60.8 MB). Free memory was 69.3 MB in the beginning and 139.1 MB in the end (delta: -69.8 MB). Peak memory consumption was 73.2 MB. Max. memory is 16.1 GB. * Witness Printer took 82.55 ms. Allocated memory is still 195.0 MB. Free memory was 139.1 MB in the beginning and 132.8 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 97]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 214]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 189]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 374]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 308]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 386]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 125]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 85]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 113]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 272]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 145]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 157]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 177]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 243]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 296]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 284]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 255]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 226]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: ((((((((1 <= main__cp && 0 < main__scheme) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) || (((((1 <= main__cp && __VERIFIER_assert__cond == 1) && 0 < main__scheme) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0))) && main__cp < main__urilen - InvariantResult [Line: 262]: Loop Invariant Derived loop invariant: (((((!(__VERIFIER_assert__cond == 0) && 1 <= main__c) && (((((((((((((1 <= main__cp && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__c + 2 <= main__tokenlen) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) || ((((((((((((1 <= main__cp && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1))) || ((((((((((((((1 <= main__cp && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__c + 2 <= main__tokenlen) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) || ((((((((((((1 <= main__cp && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1)) && main__c == 0)) && __VERIFIER_assert__cond == 1) && main__cp + 1 < main__urilen) && __VERIFIER_assert__cond == 1 - InvariantResult [Line: 131]: Loop Invariant Derived loop invariant: (main__cp < main__urilen && __VERIFIER_assert__cond == 1) && (((((1 <= main__cp && __VERIFIER_assert__cond == 1) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) || (((((1 <= main__cp && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0))) - InvariantResult [Line: 230]: Loop Invariant Derived loop invariant: (1 <= __VERIFIER_assert__cond && (((!(__VERIFIER_assert__cond == 0) && 1 <= main__c) && ((((((((((((((((1 <= main__cp && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && main__cp < main__urilen) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) || (((((((((((((((1 <= main__cp && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && main__cp < main__urilen) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__c + 2 <= main__tokenlen) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1))) || (((((((((((((((((1 <= main__cp && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && main__cp < main__urilen) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) || (((((((((((((((1 <= main__cp && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && main__cp < main__urilen) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__c + 2 <= main__tokenlen) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1)) && main__c == 0))) || ((((((((((((((((1 <= main__cp && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && main__cp < main__urilen) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 < main__urilen) && __VERIFIER_assert__cond == 1) && main__c == 0) - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: !(__VERIFIER_assert__cond == 0) - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 82 locations, 18 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 5.6s, OverallIterations: 23, TraceHistogramMax: 2, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1245 SDtfs, 2415 SDslu, 1444 SDs, 0 SdLazy, 1187 SolverSat, 130 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 258 GetRequests, 128 SyntacticMatches, 7 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 302 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 15 NumberOfFragments, 653 HoareAnnotationTreeSize, 6 FomulaSimplifications, 421683 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 6 FomulaSimplificationsInter, 30537 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 751 NumberOfCodeBlocks, 751 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 725 ConstructedInterpolants, 0 QuantifiedInterpolants, 47843 SizeOfPredicates, 16 NumberOfNonLiveVariables, 398 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 26 InterpolantComputations, 20 PerfectInterpolantSequences, 8/21 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...