./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46353719-bc8c-4664-8ea1-dfffeb438e8f/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46353719-bc8c-4664-8ea1-dfffeb438e8f/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46353719-bc8c-4664-8ea1-dfffeb438e8f/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46353719-bc8c-4664-8ea1-dfffeb438e8f/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46353719-bc8c-4664-8ea1-dfffeb438e8f/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46353719-bc8c-4664-8ea1-dfffeb438e8f/bin/utaipan-7li7fVZpFI --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 39feee77bf576ea852c42114836a4ed3182237f56346991038306ebcfd74e257 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-03 02:36:57,630 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 02:36:57,633 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 02:36:57,668 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 02:36:57,668 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 02:36:57,670 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 02:36:57,671 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 02:36:57,673 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 02:36:57,675 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 02:36:57,677 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 02:36:57,678 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 02:36:57,679 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 02:36:57,680 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 02:36:57,681 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 02:36:57,683 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 02:36:57,685 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 02:36:57,686 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 02:36:57,687 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 02:36:57,689 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 02:36:57,692 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 02:36:57,694 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 02:36:57,695 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 02:36:57,697 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 02:36:57,698 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 02:36:57,702 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 02:36:57,703 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 02:36:57,703 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 02:36:57,704 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 02:36:57,705 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 02:36:57,706 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 02:36:57,707 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 02:36:57,708 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 02:36:57,709 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 02:36:57,710 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 02:36:57,711 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 02:36:57,712 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 02:36:57,713 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 02:36:57,713 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 02:36:57,714 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 02:36:57,715 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 02:36:57,716 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 02:36:57,717 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46353719-bc8c-4664-8ea1-dfffeb438e8f/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 02:36:57,746 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 02:36:57,746 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 02:36:57,747 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 02:36:57,747 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 02:36:57,748 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 02:36:57,748 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 02:36:57,749 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 02:36:57,749 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 02:36:57,749 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 02:36:57,750 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 02:36:57,750 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 02:36:57,750 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 02:36:57,751 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 02:36:57,751 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 02:36:57,751 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 02:36:57,752 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 02:36:57,752 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 02:36:57,752 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 02:36:57,753 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 02:36:57,754 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 02:36:57,754 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 02:36:57,754 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 02:36:57,755 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 02:36:57,755 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 02:36:57,755 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 02:36:57,756 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 02:36:57,756 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 02:36:57,756 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 02:36:57,757 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 02:36:57,757 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 02:36:57,757 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 02:36:57,758 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 02:36:57,758 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:36:57,758 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 02:36:57,759 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 02:36:57,759 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 02:36:57,759 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 02:36:57,760 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 02:36:57,760 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 02:36:57,760 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 02:36:57,761 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 02:36:57,761 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_46353719-bc8c-4664-8ea1-dfffeb438e8f/bin/utaipan-7li7fVZpFI/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_46353719-bc8c-4664-8ea1-dfffeb438e8f/bin/utaipan-7li7fVZpFI 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 -> Taipan 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 -> 39feee77bf576ea852c42114836a4ed3182237f56346991038306ebcfd74e257 [2022-11-03 02:36:58,090 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 02:36:58,119 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 02:36:58,122 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 02:36:58,124 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 02:36:58,125 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 02:36:58,127 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46353719-bc8c-4664-8ea1-dfffeb438e8f/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c [2022-11-03 02:36:58,225 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46353719-bc8c-4664-8ea1-dfffeb438e8f/bin/utaipan-7li7fVZpFI/data/bebcfd3c0/14937b7a43e24ef5849e54e14023ed81/FLAG21c1aac31 [2022-11-03 02:36:58,938 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 02:36:58,939 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46353719-bc8c-4664-8ea1-dfffeb438e8f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c [2022-11-03 02:36:58,953 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46353719-bc8c-4664-8ea1-dfffeb438e8f/bin/utaipan-7li7fVZpFI/data/bebcfd3c0/14937b7a43e24ef5849e54e14023ed81/FLAG21c1aac31 [2022-11-03 02:36:59,205 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46353719-bc8c-4664-8ea1-dfffeb438e8f/bin/utaipan-7li7fVZpFI/data/bebcfd3c0/14937b7a43e24ef5849e54e14023ed81 [2022-11-03 02:36:59,216 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 02:36:59,219 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 02:36:59,223 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 02:36:59,224 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 02:36:59,228 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 02:36:59,230 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:36:59" (1/1) ... [2022-11-03 02:36:59,234 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d6d3697 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:36:59, skipping insertion in model container [2022-11-03 02:36:59,235 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:36:59" (1/1) ... [2022-11-03 02:36:59,245 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 02:36:59,318 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 02:36:59,587 WARN L230 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_46353719-bc8c-4664-8ea1-dfffeb438e8f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[919,932] [2022-11-03 02:36:59,598 WARN L230 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_46353719-bc8c-4664-8ea1-dfffeb438e8f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[1134,1147] [2022-11-03 02:36:59,619 WARN L230 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_46353719-bc8c-4664-8ea1-dfffeb438e8f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[2208,2221] [2022-11-03 02:36:59,623 WARN L230 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_46353719-bc8c-4664-8ea1-dfffeb438e8f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[2423,2436] [2022-11-03 02:36:59,629 WARN L230 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_46353719-bc8c-4664-8ea1-dfffeb438e8f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[2918,2931] [2022-11-03 02:36:59,631 WARN L230 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_46353719-bc8c-4664-8ea1-dfffeb438e8f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3133,3146] [2022-11-03 02:36:59,638 WARN L230 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_46353719-bc8c-4664-8ea1-dfffeb438e8f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3435,3448] [2022-11-03 02:36:59,641 WARN L230 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_46353719-bc8c-4664-8ea1-dfffeb438e8f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3653,3666] [2022-11-03 02:36:59,646 WARN L230 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_46353719-bc8c-4664-8ea1-dfffeb438e8f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3929,3942] [2022-11-03 02:36:59,649 WARN L230 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_46353719-bc8c-4664-8ea1-dfffeb438e8f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[4147,4160] [2022-11-03 02:36:59,659 WARN L230 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_46353719-bc8c-4664-8ea1-dfffeb438e8f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[4717,4730] [2022-11-03 02:36:59,662 WARN L230 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_46353719-bc8c-4664-8ea1-dfffeb438e8f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[4935,4948] [2022-11-03 02:36:59,759 WARN L230 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_46353719-bc8c-4664-8ea1-dfffeb438e8f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[15828,15841] [2022-11-03 02:36:59,761 WARN L230 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_46353719-bc8c-4664-8ea1-dfffeb438e8f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[16046,16059] [2022-11-03 02:36:59,767 WARN L230 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_46353719-bc8c-4664-8ea1-dfffeb438e8f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[16441,16454] [2022-11-03 02:36:59,771 WARN L230 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_46353719-bc8c-4664-8ea1-dfffeb438e8f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[16659,16672] [2022-11-03 02:36:59,783 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:36:59,802 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 02:36:59,830 WARN L230 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_46353719-bc8c-4664-8ea1-dfffeb438e8f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[919,932] [2022-11-03 02:36:59,834 WARN L230 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_46353719-bc8c-4664-8ea1-dfffeb438e8f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[1134,1147] [2022-11-03 02:36:59,850 WARN L230 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_46353719-bc8c-4664-8ea1-dfffeb438e8f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[2208,2221] [2022-11-03 02:36:59,855 WARN L230 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_46353719-bc8c-4664-8ea1-dfffeb438e8f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[2423,2436] [2022-11-03 02:36:59,857 WARN L230 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_46353719-bc8c-4664-8ea1-dfffeb438e8f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[2918,2931] [2022-11-03 02:36:59,866 WARN L230 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_46353719-bc8c-4664-8ea1-dfffeb438e8f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3133,3146] [2022-11-03 02:36:59,868 WARN L230 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_46353719-bc8c-4664-8ea1-dfffeb438e8f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3435,3448] [2022-11-03 02:36:59,870 WARN L230 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_46353719-bc8c-4664-8ea1-dfffeb438e8f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3653,3666] [2022-11-03 02:36:59,871 WARN L230 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_46353719-bc8c-4664-8ea1-dfffeb438e8f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[3929,3942] [2022-11-03 02:36:59,873 WARN L230 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_46353719-bc8c-4664-8ea1-dfffeb438e8f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[4147,4160] [2022-11-03 02:36:59,878 WARN L230 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_46353719-bc8c-4664-8ea1-dfffeb438e8f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[4717,4730] [2022-11-03 02:36:59,880 WARN L230 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_46353719-bc8c-4664-8ea1-dfffeb438e8f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[4935,4948] [2022-11-03 02:36:59,946 WARN L230 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_46353719-bc8c-4664-8ea1-dfffeb438e8f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[15828,15841] [2022-11-03 02:36:59,948 WARN L230 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_46353719-bc8c-4664-8ea1-dfffeb438e8f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[16046,16059] [2022-11-03 02:36:59,950 WARN L230 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_46353719-bc8c-4664-8ea1-dfffeb438e8f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[16441,16454] [2022-11-03 02:36:59,952 WARN L230 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_46353719-bc8c-4664-8ea1-dfffeb438e8f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+lhb-reducer.c[16659,16672] [2022-11-03 02:36:59,957 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:36:59,977 INFO L208 MainTranslator]: Completed translation [2022-11-03 02:36:59,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:36:59 WrapperNode [2022-11-03 02:36:59,978 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 02:36:59,979 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 02:36:59,980 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 02:36:59,980 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 02:36:59,989 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:36:59" (1/1) ... [2022-11-03 02:37:00,001 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:36:59" (1/1) ... [2022-11-03 02:37:00,049 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 590 [2022-11-03 02:37:00,050 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 02:37:00,051 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 02:37:00,051 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 02:37:00,051 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 02:37:00,068 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:36:59" (1/1) ... [2022-11-03 02:37:00,068 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:36:59" (1/1) ... [2022-11-03 02:37:00,071 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:36:59" (1/1) ... [2022-11-03 02:37:00,086 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:36:59" (1/1) ... [2022-11-03 02:37:00,095 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:36:59" (1/1) ... [2022-11-03 02:37:00,100 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:36:59" (1/1) ... [2022-11-03 02:37:00,116 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:36:59" (1/1) ... [2022-11-03 02:37:00,118 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:36:59" (1/1) ... [2022-11-03 02:37:00,121 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 02:37:00,122 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 02:37:00,123 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 02:37:00,123 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 02:37:00,124 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:36:59" (1/1) ... [2022-11-03 02:37:00,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:37:00,156 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46353719-bc8c-4664-8ea1-dfffeb438e8f/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:37:00,176 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46353719-bc8c-4664-8ea1-dfffeb438e8f/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 02:37:00,206 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46353719-bc8c-4664-8ea1-dfffeb438e8f/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 02:37:00,241 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 02:37:00,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 02:37:00,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 02:37:00,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 02:37:00,373 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 02:37:00,375 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 02:37:01,040 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 02:37:01,058 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 02:37:01,058 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-03 02:37:01,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:37:01 BoogieIcfgContainer [2022-11-03 02:37:01,062 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 02:37:01,064 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 02:37:01,064 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 02:37:01,070 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 02:37:01,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 02:36:59" (1/3) ... [2022-11-03 02:37:01,071 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cd31e7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:37:01, skipping insertion in model container [2022-11-03 02:37:01,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:36:59" (2/3) ... [2022-11-03 02:37:01,072 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cd31e7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:37:01, skipping insertion in model container [2022-11-03 02:37:01,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:37:01" (3/3) ... [2022-11-03 02:37:01,074 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+lhb-reducer.c [2022-11-03 02:37:01,118 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 02:37:01,119 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2022-11-03 02:37:01,181 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 02:37:01,191 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6bc2ee0a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 02:37:01,192 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-11-03 02:37:01,207 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 101 states have (on average 1.9306930693069306) internal successors, (195), 117 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:37:01,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-03 02:37:01,228 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:37:01,228 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-03 02:37:01,229 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-03 02:37:01,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:37:01,238 INFO L85 PathProgramCache]: Analyzing trace with hash 547035891, now seen corresponding path program 1 times [2022-11-03 02:37:01,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:37:01,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198935321] [2022-11-03 02:37:01,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:37:01,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:37:01,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:37:01,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:37:01,654 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:37:01,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198935321] [2022-11-03 02:37:01,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198935321] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:37:01,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:37:01,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 02:37:01,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149859508] [2022-11-03 02:37:01,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:37:01,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:37:01,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:37:01,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:37:01,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:37:01,714 INFO L87 Difference]: Start difference. First operand has 118 states, 101 states have (on average 1.9306930693069306) internal successors, (195), 117 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:37:02,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:37:02,149 INFO L93 Difference]: Finished difference Result 126 states and 200 transitions. [2022-11-03 02:37:02,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:37:02,152 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-03 02:37:02,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:37:02,169 INFO L225 Difference]: With dead ends: 126 [2022-11-03 02:37:02,170 INFO L226 Difference]: Without dead ends: 113 [2022-11-03 02:37:02,180 INFO L412 NwaCegarLoop]: 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 [2022-11-03 02:37:02,186 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 158 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:37:02,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 159 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:37:02,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-11-03 02:37:02,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2022-11-03 02:37:02,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 98 states have (on average 1.3673469387755102) internal successors, (134), 112 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:37:02,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 134 transitions. [2022-11-03 02:37:02,258 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 134 transitions. Word has length 6 [2022-11-03 02:37:02,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:37:02,259 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 134 transitions. [2022-11-03 02:37:02,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:37:02,260 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 134 transitions. [2022-11-03 02:37:02,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-03 02:37:02,261 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:37:02,261 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:37:02,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 02:37:02,263 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-03 02:37:02,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:37:02,264 INFO L85 PathProgramCache]: Analyzing trace with hash -221752512, now seen corresponding path program 1 times [2022-11-03 02:37:02,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:37:02,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123595183] [2022-11-03 02:37:02,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:37:02,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:37:02,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:37:02,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:37:02,508 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:37:02,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123595183] [2022-11-03 02:37:02,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123595183] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:37:02,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:37:02,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 02:37:02,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627296333] [2022-11-03 02:37:02,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:37:02,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:37:02,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:37:02,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:37:02,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:37:02,513 INFO L87 Difference]: Start difference. First operand 113 states and 134 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:37:02,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:37:02,754 INFO L93 Difference]: Finished difference Result 113 states and 134 transitions. [2022-11-03 02:37:02,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:37:02,755 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-03 02:37:02,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:37:02,757 INFO L225 Difference]: With dead ends: 113 [2022-11-03 02:37:02,757 INFO L226 Difference]: Without dead ends: 108 [2022-11-03 02:37:02,757 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:37:02,759 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 18 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:37:02,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 290 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:37:02,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-11-03 02:37:02,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2022-11-03 02:37:02,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 94 states have (on average 1.2765957446808511) internal successors, (120), 107 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:37:02,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 120 transitions. [2022-11-03 02:37:02,770 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 120 transitions. Word has length 7 [2022-11-03 02:37:02,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:37:02,771 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 120 transitions. [2022-11-03 02:37:02,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:37:02,772 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 120 transitions. [2022-11-03 02:37:02,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 02:37:02,772 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:37:02,772 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:37:02,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 02:37:02,773 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-03 02:37:02,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:37:02,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1948841692, now seen corresponding path program 1 times [2022-11-03 02:37:02,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:37:02,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022865377] [2022-11-03 02:37:02,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:37:02,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:37:02,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:37:02,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:37:02,976 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:37:02,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022865377] [2022-11-03 02:37:02,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022865377] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:37:02,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:37:02,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 02:37:02,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409175798] [2022-11-03 02:37:02,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:37:02,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:37:02,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:37:02,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:37:02,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:37:02,980 INFO L87 Difference]: Start difference. First operand 108 states and 120 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:37:03,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:37:03,264 INFO L93 Difference]: Finished difference Result 108 states and 120 transitions. [2022-11-03 02:37:03,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:37:03,265 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-03 02:37:03,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:37:03,266 INFO L225 Difference]: With dead ends: 108 [2022-11-03 02:37:03,267 INFO L226 Difference]: Without dead ends: 106 [2022-11-03 02:37:03,267 INFO L412 NwaCegarLoop]: 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 [2022-11-03 02:37:03,268 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 93 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:37:03,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 96 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:37:03,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-11-03 02:37:03,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2022-11-03 02:37:03,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 93 states have (on average 1.2688172043010753) internal successors, (118), 105 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:37:03,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 118 transitions. [2022-11-03 02:37:03,277 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 118 transitions. Word has length 10 [2022-11-03 02:37:03,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:37:03,278 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 118 transitions. [2022-11-03 02:37:03,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:37:03,278 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 118 transitions. [2022-11-03 02:37:03,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 02:37:03,279 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:37:03,279 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:37:03,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-03 02:37:03,280 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-03 02:37:03,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:37:03,280 INFO L85 PathProgramCache]: Analyzing trace with hash 284554395, now seen corresponding path program 1 times [2022-11-03 02:37:03,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:37:03,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370858108] [2022-11-03 02:37:03,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:37:03,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:37:03,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:37:03,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:37:03,363 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:37:03,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370858108] [2022-11-03 02:37:03,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370858108] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:37:03,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:37:03,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 02:37:03,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588680494] [2022-11-03 02:37:03,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:37:03,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:37:03,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:37:03,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:37:03,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:37:03,366 INFO L87 Difference]: Start difference. First operand 106 states and 118 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:37:03,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:37:03,526 INFO L93 Difference]: Finished difference Result 106 states and 118 transitions. [2022-11-03 02:37:03,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:37:03,527 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-03 02:37:03,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:37:03,528 INFO L225 Difference]: With dead ends: 106 [2022-11-03 02:37:03,528 INFO L226 Difference]: Without dead ends: 102 [2022-11-03 02:37:03,528 INFO L412 NwaCegarLoop]: 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 [2022-11-03 02:37:03,530 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 11 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:37:03,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 238 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:37:03,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-11-03 02:37:03,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-11-03 02:37:03,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 90 states have (on average 1.2666666666666666) internal successors, (114), 101 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:37:03,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 114 transitions. [2022-11-03 02:37:03,538 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 114 transitions. Word has length 11 [2022-11-03 02:37:03,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:37:03,538 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 114 transitions. [2022-11-03 02:37:03,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:37:03,539 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 114 transitions. [2022-11-03 02:37:03,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 02:37:03,539 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:37:03,539 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:37:03,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-03 02:37:03,540 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-03 02:37:03,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:37:03,541 INFO L85 PathProgramCache]: Analyzing trace with hash 246397519, now seen corresponding path program 1 times [2022-11-03 02:37:03,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:37:03,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122449775] [2022-11-03 02:37:03,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:37:03,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:37:03,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:37:03,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:37:03,734 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:37:03,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122449775] [2022-11-03 02:37:03,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122449775] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:37:03,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:37:03,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 02:37:03,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765883771] [2022-11-03 02:37:03,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:37:03,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:37:03,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:37:03,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:37:03,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:37:03,737 INFO L87 Difference]: Start difference. First operand 102 states and 114 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:37:04,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:37:04,002 INFO L93 Difference]: Finished difference Result 120 states and 134 transitions. [2022-11-03 02:37:04,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:37:04,003 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-03 02:37:04,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:37:04,004 INFO L225 Difference]: With dead ends: 120 [2022-11-03 02:37:04,005 INFO L226 Difference]: Without dead ends: 118 [2022-11-03 02:37:04,005 INFO L412 NwaCegarLoop]: 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 [2022-11-03 02:37:04,007 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 110 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:37:04,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 106 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:37:04,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-11-03 02:37:04,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 100. [2022-11-03 02:37:04,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 89 states have (on average 1.2584269662921348) internal successors, (112), 99 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:37:04,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 112 transitions. [2022-11-03 02:37:04,024 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 112 transitions. Word has length 12 [2022-11-03 02:37:04,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:37:04,025 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 112 transitions. [2022-11-03 02:37:04,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:37:04,026 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 112 transitions. [2022-11-03 02:37:04,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 02:37:04,028 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:37:04,028 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:37:04,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-03 02:37:04,029 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-03 02:37:04,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:37:04,031 INFO L85 PathProgramCache]: Analyzing trace with hash 248121423, now seen corresponding path program 1 times [2022-11-03 02:37:04,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:37:04,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467843535] [2022-11-03 02:37:04,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:37:04,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:37:04,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:37:04,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:37:04,177 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:37:04,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467843535] [2022-11-03 02:37:04,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467843535] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:37:04,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:37:04,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 02:37:04,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613411722] [2022-11-03 02:37:04,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:37:04,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:37:04,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:37:04,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:37:04,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:37:04,188 INFO L87 Difference]: Start difference. First operand 100 states and 112 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:37:04,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:37:04,423 INFO L93 Difference]: Finished difference Result 100 states and 112 transitions. [2022-11-03 02:37:04,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:37:04,424 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-03 02:37:04,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:37:04,425 INFO L225 Difference]: With dead ends: 100 [2022-11-03 02:37:04,425 INFO L226 Difference]: Without dead ends: 98 [2022-11-03 02:37:04,425 INFO L412 NwaCegarLoop]: 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 [2022-11-03 02:37:04,426 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 83 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:37:04,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 78 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:37:04,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-11-03 02:37:04,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-11-03 02:37:04,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 88 states have (on average 1.25) internal successors, (110), 97 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:37:04,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 110 transitions. [2022-11-03 02:37:04,432 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 110 transitions. Word has length 12 [2022-11-03 02:37:04,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:37:04,433 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 110 transitions. [2022-11-03 02:37:04,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:37:04,433 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 110 transitions. [2022-11-03 02:37:04,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 02:37:04,434 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:37:04,434 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:37:04,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-03 02:37:04,434 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-03 02:37:04,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:37:04,435 INFO L85 PathProgramCache]: Analyzing trace with hash -951607394, now seen corresponding path program 1 times [2022-11-03 02:37:04,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:37:04,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021195486] [2022-11-03 02:37:04,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:37:04,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:37:04,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:37:04,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:37:04,668 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:37:04,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021195486] [2022-11-03 02:37:04,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021195486] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:37:04,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:37:04,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 02:37:04,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134623472] [2022-11-03 02:37:04,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:37:04,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 02:37:04,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:37:04,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 02:37:04,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:37:04,671 INFO L87 Difference]: Start difference. First operand 98 states and 110 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:37:04,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:37:04,974 INFO L93 Difference]: Finished difference Result 135 states and 151 transitions. [2022-11-03 02:37:04,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 02:37:04,975 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-03 02:37:04,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:37:04,976 INFO L225 Difference]: With dead ends: 135 [2022-11-03 02:37:04,976 INFO L226 Difference]: Without dead ends: 133 [2022-11-03 02:37:04,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:37:04,977 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 53 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:37:04,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 253 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:37:04,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-11-03 02:37:04,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 104. [2022-11-03 02:37:04,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 94 states have (on average 1.2553191489361701) internal successors, (118), 103 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:37:04,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 118 transitions. [2022-11-03 02:37:04,985 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 118 transitions. Word has length 13 [2022-11-03 02:37:04,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:37:04,986 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 118 transitions. [2022-11-03 02:37:04,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:37:04,986 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 118 transitions. [2022-11-03 02:37:04,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 02:37:04,987 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:37:04,987 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:37:04,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-03 02:37:04,988 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-03 02:37:04,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:37:04,988 INFO L85 PathProgramCache]: Analyzing trace with hash -950060249, now seen corresponding path program 1 times [2022-11-03 02:37:04,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:37:04,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454303914] [2022-11-03 02:37:04,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:37:04,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:37:04,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:37:05,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:37:05,062 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:37:05,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454303914] [2022-11-03 02:37:05,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454303914] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:37:05,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:37:05,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 02:37:05,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915571547] [2022-11-03 02:37:05,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:37:05,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:37:05,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:37:05,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:37:05,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:37:05,065 INFO L87 Difference]: Start difference. First operand 104 states and 118 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:37:05,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:37:05,333 INFO L93 Difference]: Finished difference Result 125 states and 141 transitions. [2022-11-03 02:37:05,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:37:05,334 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-03 02:37:05,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:37:05,335 INFO L225 Difference]: With dead ends: 125 [2022-11-03 02:37:05,335 INFO L226 Difference]: Without dead ends: 123 [2022-11-03 02:37:05,335 INFO L412 NwaCegarLoop]: 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 [2022-11-03 02:37:05,336 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 101 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:37:05,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 98 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:37:05,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-11-03 02:37:05,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 102. [2022-11-03 02:37:05,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 93 states have (on average 1.2473118279569892) internal successors, (116), 101 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:37:05,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 116 transitions. [2022-11-03 02:37:05,343 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 116 transitions. Word has length 13 [2022-11-03 02:37:05,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:37:05,344 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 116 transitions. [2022-11-03 02:37:05,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:37:05,345 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 116 transitions. [2022-11-03 02:37:05,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 02:37:05,345 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:37:05,346 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:37:05,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-03 02:37:05,346 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-03 02:37:05,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:37:05,347 INFO L85 PathProgramCache]: Analyzing trace with hash -898166314, now seen corresponding path program 1 times [2022-11-03 02:37:05,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:37:05,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629866055] [2022-11-03 02:37:05,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:37:05,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:37:05,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:37:05,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:37:05,522 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:37:05,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629866055] [2022-11-03 02:37:05,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629866055] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:37:05,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:37:05,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 02:37:05,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749985784] [2022-11-03 02:37:05,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:37:05,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 02:37:05,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:37:05,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 02:37:05,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:37:05,525 INFO L87 Difference]: Start difference. First operand 102 states and 116 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:37:05,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:37:05,788 INFO L93 Difference]: Finished difference Result 112 states and 126 transitions. [2022-11-03 02:37:05,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:37:05,789 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-03 02:37:05,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:37:05,790 INFO L225 Difference]: With dead ends: 112 [2022-11-03 02:37:05,790 INFO L226 Difference]: Without dead ends: 108 [2022-11-03 02:37:05,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:37:05,791 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 24 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:37:05,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 222 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:37:05,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-11-03 02:37:05,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 103. [2022-11-03 02:37:05,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 94 states have (on average 1.2446808510638299) internal successors, (117), 102 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:37:05,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 117 transitions. [2022-11-03 02:37:05,800 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 117 transitions. Word has length 13 [2022-11-03 02:37:05,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:37:05,801 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 117 transitions. [2022-11-03 02:37:05,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:37:05,801 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 117 transitions. [2022-11-03 02:37:05,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 02:37:05,803 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:37:05,803 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:37:05,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-03 02:37:05,803 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-03 02:37:05,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:37:05,804 INFO L85 PathProgramCache]: Analyzing trace with hash 612907497, now seen corresponding path program 1 times [2022-11-03 02:37:05,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:37:05,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451979625] [2022-11-03 02:37:05,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:37:05,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:37:05,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:37:06,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:37:06,033 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:37:06,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451979625] [2022-11-03 02:37:06,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451979625] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:37:06,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:37:06,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 02:37:06,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378941639] [2022-11-03 02:37:06,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:37:06,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 02:37:06,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:37:06,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 02:37:06,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:37:06,035 INFO L87 Difference]: Start difference. First operand 103 states and 117 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:37:06,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:37:06,324 INFO L93 Difference]: Finished difference Result 130 states and 146 transitions. [2022-11-03 02:37:06,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 02:37:06,325 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-03 02:37:06,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:37:06,326 INFO L225 Difference]: With dead ends: 130 [2022-11-03 02:37:06,326 INFO L226 Difference]: Without dead ends: 128 [2022-11-03 02:37:06,327 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:37:06,327 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 42 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:37:06,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 274 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:37:06,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-11-03 02:37:06,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 106. [2022-11-03 02:37:06,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 97 states have (on average 1.2371134020618557) internal successors, (120), 105 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:37:06,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2022-11-03 02:37:06,334 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 14 [2022-11-03 02:37:06,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:37:06,334 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2022-11-03 02:37:06,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:37:06,335 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2022-11-03 02:37:06,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 02:37:06,335 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:37:06,336 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:37:06,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-03 02:37:06,336 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-03 02:37:06,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:37:06,337 INFO L85 PathProgramCache]: Analyzing trace with hash 333456161, now seen corresponding path program 1 times [2022-11-03 02:37:06,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:37:06,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948467962] [2022-11-03 02:37:06,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:37:06,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:37:06,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:37:06,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:37:06,470 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:37:06,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948467962] [2022-11-03 02:37:06,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948467962] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:37:06,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:37:06,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 02:37:06,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156606773] [2022-11-03 02:37:06,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:37:06,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:37:06,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:37:06,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:37:06,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:37:06,472 INFO L87 Difference]: Start difference. First operand 106 states and 120 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:37:06,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:37:06,569 INFO L93 Difference]: Finished difference Result 106 states and 120 transitions. [2022-11-03 02:37:06,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:37:06,575 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-03 02:37:06,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:37:06,577 INFO L225 Difference]: With dead ends: 106 [2022-11-03 02:37:06,577 INFO L226 Difference]: Without dead ends: 104 [2022-11-03 02:37:06,577 INFO L412 NwaCegarLoop]: 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 [2022-11-03 02:37:06,578 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 97 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:37:06,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 134 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:37:06,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-11-03 02:37:06,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2022-11-03 02:37:06,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 96 states have (on average 1.2291666666666667) internal successors, (118), 103 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:37:06,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 118 transitions. [2022-11-03 02:37:06,590 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 118 transitions. Word has length 15 [2022-11-03 02:37:06,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:37:06,590 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 118 transitions. [2022-11-03 02:37:06,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:37:06,590 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 118 transitions. [2022-11-03 02:37:06,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-03 02:37:06,593 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:37:06,593 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:37:06,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-03 02:37:06,594 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-03 02:37:06,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:37:06,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1747210525, now seen corresponding path program 1 times [2022-11-03 02:37:06,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:37:06,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559415565] [2022-11-03 02:37:06,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:37:06,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:37:06,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:37:06,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:37:06,660 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:37:06,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559415565] [2022-11-03 02:37:06,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559415565] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:37:06,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:37:06,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 02:37:06,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66550991] [2022-11-03 02:37:06,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:37:06,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:37:06,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:37:06,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:37:06,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:37:06,662 INFO L87 Difference]: Start difference. First operand 104 states and 118 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:37:06,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:37:06,800 INFO L93 Difference]: Finished difference Result 104 states and 118 transitions. [2022-11-03 02:37:06,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:37:06,801 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-03 02:37:06,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:37:06,802 INFO L225 Difference]: With dead ends: 104 [2022-11-03 02:37:06,802 INFO L226 Difference]: Without dead ends: 100 [2022-11-03 02:37:06,803 INFO L412 NwaCegarLoop]: 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 [2022-11-03 02:37:06,803 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 6 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:37:06,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 210 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:37:06,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-11-03 02:37:06,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-11-03 02:37:06,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 93 states have (on average 1.2258064516129032) internal successors, (114), 99 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:37:06,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 114 transitions. [2022-11-03 02:37:06,810 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 114 transitions. Word has length 16 [2022-11-03 02:37:06,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:37:06,810 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 114 transitions. [2022-11-03 02:37:06,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:37:06,810 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 114 transitions. [2022-11-03 02:37:06,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 02:37:06,811 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:37:06,811 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:37:06,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-03 02:37:06,812 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-03 02:37:06,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:37:06,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1396602585, now seen corresponding path program 1 times [2022-11-03 02:37:06,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:37:06,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790419461] [2022-11-03 02:37:06,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:37:06,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:37:06,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:37:06,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:37:06,944 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:37:06,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790419461] [2022-11-03 02:37:06,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790419461] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:37:06,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:37:06,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 02:37:06,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945987167] [2022-11-03 02:37:06,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:37:06,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 02:37:06,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:37:06,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 02:37:06,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:37:06,946 INFO L87 Difference]: Start difference. First operand 100 states and 114 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:37:07,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:37:07,218 INFO L93 Difference]: Finished difference Result 115 states and 131 transitions. [2022-11-03 02:37:07,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:37:07,219 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-03 02:37:07,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:37:07,220 INFO L225 Difference]: With dead ends: 115 [2022-11-03 02:37:07,220 INFO L226 Difference]: Without dead ends: 113 [2022-11-03 02:37:07,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-03 02:37:07,224 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 216 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:37:07,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 48 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:37:07,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-11-03 02:37:07,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 96. [2022-11-03 02:37:07,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 90 states have (on average 1.2222222222222223) internal successors, (110), 95 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:37:07,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 110 transitions. [2022-11-03 02:37:07,239 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 110 transitions. Word has length 17 [2022-11-03 02:37:07,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:37:07,240 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 110 transitions. [2022-11-03 02:37:07,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:37:07,241 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 110 transitions. [2022-11-03 02:37:07,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 02:37:07,242 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:37:07,253 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:37:07,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-03 02:37:07,253 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-03 02:37:07,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:37:07,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1343161505, now seen corresponding path program 1 times [2022-11-03 02:37:07,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:37:07,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200497599] [2022-11-03 02:37:07,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:37:07,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:37:07,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:37:07,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:37:07,414 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:37:07,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200497599] [2022-11-03 02:37:07,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200497599] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:37:07,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:37:07,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 02:37:07,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637611851] [2022-11-03 02:37:07,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:37:07,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 02:37:07,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:37:07,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 02:37:07,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:37:07,417 INFO L87 Difference]: Start difference. First operand 96 states and 110 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:37:07,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:37:07,660 INFO L93 Difference]: Finished difference Result 96 states and 110 transitions. [2022-11-03 02:37:07,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:37:07,661 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-03 02:37:07,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:37:07,662 INFO L225 Difference]: With dead ends: 96 [2022-11-03 02:37:07,662 INFO L226 Difference]: Without dead ends: 92 [2022-11-03 02:37:07,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-03 02:37:07,663 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 130 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:37:07,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 38 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:37:07,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-11-03 02:37:07,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-11-03 02:37:07,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 87 states have (on average 1.2183908045977012) internal successors, (106), 91 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:37:07,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 106 transitions. [2022-11-03 02:37:07,668 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 106 transitions. Word has length 17 [2022-11-03 02:37:07,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:37:07,669 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 106 transitions. [2022-11-03 02:37:07,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:37:07,669 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 106 transitions. [2022-11-03 02:37:07,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 02:37:07,669 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:37:07,670 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:37:07,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-03 02:37:07,670 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-03 02:37:07,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:37:07,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1655929480, now seen corresponding path program 1 times [2022-11-03 02:37:07,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:37:07,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215635658] [2022-11-03 02:37:07,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:37:07,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:37:07,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:37:07,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:37:07,801 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:37:07,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215635658] [2022-11-03 02:37:07,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215635658] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:37:07,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:37:07,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 02:37:07,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342964369] [2022-11-03 02:37:07,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:37:07,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 02:37:07,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:37:07,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 02:37:07,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:37:07,804 INFO L87 Difference]: Start difference. First operand 92 states and 106 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:37:08,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:37:08,076 INFO L93 Difference]: Finished difference Result 102 states and 118 transitions. [2022-11-03 02:37:08,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:37:08,082 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-03 02:37:08,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:37:08,083 INFO L225 Difference]: With dead ends: 102 [2022-11-03 02:37:08,083 INFO L226 Difference]: Without dead ends: 53 [2022-11-03 02:37:08,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-03 02:37:08,084 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 134 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:37:08,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 41 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:37:08,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-03 02:37:08,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-11-03 02:37:08,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 52 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:37:08,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2022-11-03 02:37:08,087 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 17 [2022-11-03 02:37:08,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:37:08,088 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2022-11-03 02:37:08,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:37:08,088 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2022-11-03 02:37:08,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-03 02:37:08,089 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:37:08,089 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:37:08,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-03 02:37:08,090 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-03 02:37:08,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:37:08,090 INFO L85 PathProgramCache]: Analyzing trace with hash -789661849, now seen corresponding path program 1 times [2022-11-03 02:37:08,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:37:08,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532928827] [2022-11-03 02:37:08,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:37:08,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:37:08,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:37:08,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:37:08,401 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:37:08,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532928827] [2022-11-03 02:37:08,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532928827] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:37:08,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:37:08,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-03 02:37:08,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646256044] [2022-11-03 02:37:08,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:37:08,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-03 02:37:08,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:37:08,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-03 02:37:08,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2022-11-03 02:37:08,407 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:37:08,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:37:08,608 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2022-11-03 02:37:08,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-03 02:37:08,609 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-11-03 02:37:08,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:37:08,610 INFO L225 Difference]: With dead ends: 53 [2022-11-03 02:37:08,610 INFO L226 Difference]: Without dead ends: 51 [2022-11-03 02:37:08,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-11-03 02:37:08,611 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 83 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:37:08,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 21 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:37:08,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-11-03 02:37:08,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-11-03 02:37:08,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 48 states have (on average 1.0625) internal successors, (51), 50 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:37:08,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2022-11-03 02:37:08,615 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 43 [2022-11-03 02:37:08,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:37:08,615 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2022-11-03 02:37:08,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:37:08,616 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2022-11-03 02:37:08,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-03 02:37:08,617 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:37:08,617 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:37:08,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-03 02:37:08,617 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-03 02:37:08,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:37:08,618 INFO L85 PathProgramCache]: Analyzing trace with hash -789645961, now seen corresponding path program 1 times [2022-11-03 02:37:08,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:37:08,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623161231] [2022-11-03 02:37:08,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:37:08,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:37:08,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:37:08,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:37:08,936 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:37:08,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623161231] [2022-11-03 02:37:08,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623161231] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:37:08,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:37:08,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-03 02:37:08,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817489008] [2022-11-03 02:37:08,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:37:08,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-03 02:37:08,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:37:08,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-03 02:37:08,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2022-11-03 02:37:08,938 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:37:09,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:37:09,123 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2022-11-03 02:37:09,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-03 02:37:09,124 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-11-03 02:37:09,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:37:09,126 INFO L225 Difference]: With dead ends: 58 [2022-11-03 02:37:09,126 INFO L226 Difference]: Without dead ends: 56 [2022-11-03 02:37:09,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-11-03 02:37:09,128 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 70 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:37:09,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 21 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:37:09,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-11-03 02:37:09,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 49. [2022-11-03 02:37:09,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 48 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:37:09,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2022-11-03 02:37:09,134 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 43 [2022-11-03 02:37:09,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:37:09,134 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2022-11-03 02:37:09,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:37:09,135 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2022-11-03 02:37:09,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-03 02:37:09,138 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:37:09,138 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:37:09,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-03 02:37:09,139 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-03 02:37:09,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:37:09,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1290290900, now seen corresponding path program 1 times [2022-11-03 02:37:09,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:37:09,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328885286] [2022-11-03 02:37:09,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:37:09,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:37:09,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:37:09,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:37:09,398 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:37:09,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328885286] [2022-11-03 02:37:09,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328885286] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:37:09,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:37:09,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 02:37:09,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400350784] [2022-11-03 02:37:09,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:37:09,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 02:37:09,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:37:09,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 02:37:09,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:37:09,401 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:37:09,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:37:09,560 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2022-11-03 02:37:09,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:37:09,560 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-11-03 02:37:09,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:37:09,561 INFO L225 Difference]: With dead ends: 49 [2022-11-03 02:37:09,561 INFO L226 Difference]: Without dead ends: 45 [2022-11-03 02:37:09,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-03 02:37:09,563 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 56 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:37:09,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 10 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:37:09,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-11-03 02:37:09,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-11-03 02:37:09,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:37:09,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2022-11-03 02:37:09,568 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 44 [2022-11-03 02:37:09,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:37:09,569 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2022-11-03 02:37:09,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:37:09,570 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2022-11-03 02:37:09,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-03 02:37:09,571 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:37:09,571 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:37:09,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-03 02:37:09,572 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-03 02:37:09,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:37:09,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1290783444, now seen corresponding path program 1 times [2022-11-03 02:37:09,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:37:09,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889734858] [2022-11-03 02:37:09,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:37:09,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:37:09,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:37:09,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:37:09,799 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:37:09,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889734858] [2022-11-03 02:37:09,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889734858] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:37:09,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:37:09,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 02:37:09,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61539952] [2022-11-03 02:37:09,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:37:09,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 02:37:09,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:37:09,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 02:37:09,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:37:09,803 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:37:09,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:37:09,961 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2022-11-03 02:37:09,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:37:09,962 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-11-03 02:37:09,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:37:09,962 INFO L225 Difference]: With dead ends: 49 [2022-11-03 02:37:09,962 INFO L226 Difference]: Without dead ends: 0 [2022-11-03 02:37:09,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-03 02:37:09,964 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 69 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:37:09,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 7 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:37:09,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-03 02:37:09,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-03 02:37:09,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:37:09,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-03 02:37:09,965 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 44 [2022-11-03 02:37:09,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:37:09,965 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-03 02:37:09,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:37:09,966 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-03 02:37:09,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-03 02:37:09,971 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (15 of 16 remaining) [2022-11-03 02:37:09,972 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (14 of 16 remaining) [2022-11-03 02:37:09,972 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (13 of 16 remaining) [2022-11-03 02:37:09,973 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (12 of 16 remaining) [2022-11-03 02:37:09,973 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (11 of 16 remaining) [2022-11-03 02:37:09,973 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (10 of 16 remaining) [2022-11-03 02:37:09,973 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (9 of 16 remaining) [2022-11-03 02:37:09,974 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (8 of 16 remaining) [2022-11-03 02:37:09,974 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (7 of 16 remaining) [2022-11-03 02:37:09,974 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (6 of 16 remaining) [2022-11-03 02:37:09,977 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (5 of 16 remaining) [2022-11-03 02:37:09,978 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (4 of 16 remaining) [2022-11-03 02:37:09,978 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (3 of 16 remaining) [2022-11-03 02:37:09,978 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (2 of 16 remaining) [2022-11-03 02:37:09,979 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (1 of 16 remaining) [2022-11-03 02:37:09,979 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (0 of 16 remaining) [2022-11-03 02:37:09,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-03 02:37:09,982 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-03 02:37:10,201 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 48) no Hoare annotation was computed. [2022-11-03 02:37:10,202 INFO L899 garLoopResultBuilder]: For program point L217(lines 217 229) no Hoare annotation was computed. [2022-11-03 02:37:10,202 INFO L899 garLoopResultBuilder]: For program point L597(lines 597 969) no Hoare annotation was computed. [2022-11-03 02:37:10,202 INFO L899 garLoopResultBuilder]: For program point L366(lines 366 991) no Hoare annotation was computed. [2022-11-03 02:37:10,202 INFO L899 garLoopResultBuilder]: For program point L267(lines 267 275) no Hoare annotation was computed. [2022-11-03 02:37:10,202 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 883) no Hoare annotation was computed. [2022-11-03 02:37:10,203 INFO L899 garLoopResultBuilder]: For program point L581(lines 581 971) no Hoare annotation was computed. [2022-11-03 02:37:10,203 INFO L899 garLoopResultBuilder]: For program point L36(line 36) no Hoare annotation was computed. [2022-11-03 02:37:10,203 INFO L899 garLoopResultBuilder]: For program point L895(line 895) no Hoare annotation was computed. [2022-11-03 02:37:10,203 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-03 02:37:10,204 INFO L899 garLoopResultBuilder]: For program point L317(lines 317 994) no Hoare annotation was computed. [2022-11-03 02:37:10,204 INFO L899 garLoopResultBuilder]: For program point L185(line 185) no Hoare annotation was computed. [2022-11-03 02:37:10,204 INFO L899 garLoopResultBuilder]: For program point L400(lines 400 424) no Hoare annotation was computed. [2022-11-03 02:37:10,204 INFO L899 garLoopResultBuilder]: For program point L136(lines 136 242) no Hoare annotation was computed. [2022-11-03 02:37:10,204 INFO L899 garLoopResultBuilder]: For program point L103(lines 103 125) no Hoare annotation was computed. [2022-11-03 02:37:10,204 INFO L899 garLoopResultBuilder]: For program point L615(lines 615 626) no Hoare annotation was computed. [2022-11-03 02:37:10,205 INFO L899 garLoopResultBuilder]: For program point L929(lines 929 941) no Hoare annotation was computed. [2022-11-03 02:37:10,205 INFO L899 garLoopResultBuilder]: For program point L219(line 219) no Hoare annotation was computed. [2022-11-03 02:37:10,205 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 269) no Hoare annotation was computed. [2022-11-03 02:37:10,205 INFO L899 garLoopResultBuilder]: For program point L665(lines 665 963) no Hoare annotation was computed. [2022-11-03 02:37:10,206 INFO L899 garLoopResultBuilder]: For program point L434(lines 434 985) no Hoare annotation was computed. [2022-11-03 02:37:10,206 INFO L899 garLoopResultBuilder]: For program point L269(line 269) no Hoare annotation was computed. [2022-11-03 02:37:10,206 INFO L899 garLoopResultBuilder]: For program point L649(lines 649 965) no Hoare annotation was computed. [2022-11-03 02:37:10,206 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 173) no Hoare annotation was computed. [2022-11-03 02:37:10,206 INFO L899 garLoopResultBuilder]: For program point L385(lines 385 988) no Hoare annotation was computed. [2022-11-03 02:37:10,207 INFO L899 garLoopResultBuilder]: For program point L22(lines 22 1005) no Hoare annotation was computed. [2022-11-03 02:37:10,207 INFO L899 garLoopResultBuilder]: For program point L468(lines 468 492) no Hoare annotation was computed. [2022-11-03 02:37:10,207 INFO L899 garLoopResultBuilder]: For program point L881(lines 881 907) no Hoare annotation was computed. [2022-11-03 02:37:10,207 INFO L899 garLoopResultBuilder]: For program point L171(lines 171 193) no Hoare annotation was computed. [2022-11-03 02:37:10,207 INFO L899 garLoopResultBuilder]: For program point L683(lines 683 694) no Hoare annotation was computed. [2022-11-03 02:37:10,208 INFO L899 garLoopResultBuilder]: For program point L105(line 105) no Hoare annotation was computed. [2022-11-03 02:37:10,208 INFO L899 garLoopResultBuilder]: For program point L72(lines 72 288) no Hoare annotation was computed. [2022-11-03 02:37:10,208 INFO L899 garLoopResultBuilder]: For program point L931(line 931) no Hoare annotation was computed. [2022-11-03 02:37:10,208 INFO L899 garLoopResultBuilder]: For program point L733(lines 733 957) no Hoare annotation was computed. [2022-11-03 02:37:10,208 INFO L899 garLoopResultBuilder]: For program point L155(lines 155 234) no Hoare annotation was computed. [2022-11-03 02:37:10,209 INFO L899 garLoopResultBuilder]: For program point L502(lines 502 979) no Hoare annotation was computed. [2022-11-03 02:37:10,209 INFO L899 garLoopResultBuilder]: For program point L205(lines 205 231) no Hoare annotation was computed. [2022-11-03 02:37:10,209 INFO L899 garLoopResultBuilder]: For program point L717(lines 717 959) no Hoare annotation was computed. [2022-11-03 02:37:10,209 INFO L899 garLoopResultBuilder]: For program point L453(lines 453 982) no Hoare annotation was computed. [2022-11-03 02:37:10,210 INFO L902 garLoopResultBuilder]: At program point L932(lines 17 1006) the Hoare annotation is: true [2022-11-03 02:37:10,210 INFO L899 garLoopResultBuilder]: For program point L866(lines 866 946) no Hoare annotation was computed. [2022-11-03 02:37:10,210 INFO L899 garLoopResultBuilder]: For program point L255(lines 255 277) no Hoare annotation was computed. [2022-11-03 02:37:10,210 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 207) no Hoare annotation was computed. [2022-11-03 02:37:10,210 INFO L899 garLoopResultBuilder]: For program point L536(lines 536 560) no Hoare annotation was computed. [2022-11-03 02:37:10,211 INFO L899 garLoopResultBuilder]: For program point L883(line 883) no Hoare annotation was computed. [2022-11-03 02:37:10,211 INFO L899 garLoopResultBuilder]: For program point L751(lines 751 762) no Hoare annotation was computed. [2022-11-03 02:37:10,211 INFO L899 garLoopResultBuilder]: For program point L173(line 173) no Hoare annotation was computed. [2022-11-03 02:37:10,211 INFO L899 garLoopResultBuilder]: For program point L801(lines 801 951) no Hoare annotation was computed. [2022-11-03 02:37:10,211 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-03 02:37:10,212 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 185) no Hoare annotation was computed. [2022-11-03 02:37:10,212 INFO L899 garLoopResultBuilder]: For program point L157(line 157) no Hoare annotation was computed. [2022-11-03 02:37:10,212 INFO L899 garLoopResultBuilder]: For program point L570(lines 570 973) no Hoare annotation was computed. [2022-11-03 02:37:10,212 INFO L899 garLoopResultBuilder]: For program point L917(lines 917 943) no Hoare annotation was computed. [2022-11-03 02:37:10,212 INFO L899 garLoopResultBuilder]: For program point L785(lines 785 953) no Hoare annotation was computed. [2022-11-03 02:37:10,213 INFO L899 garLoopResultBuilder]: For program point L207(line 207) no Hoare annotation was computed. [2022-11-03 02:37:10,213 INFO L899 garLoopResultBuilder]: For program point L521(lines 521 976) no Hoare annotation was computed. [2022-11-03 02:37:10,213 INFO L895 garLoopResultBuilder]: At program point L868(lines 26 1000) the Hoare annotation is: (and (<= 0 |ULTIMATE.start_main_~main__t~0#1|) (<= |ULTIMATE.start_main_~main__t~0#1| |ULTIMATE.start_main_~main__tagbuf_len~0#1|)) [2022-11-03 02:37:10,213 INFO L899 garLoopResultBuilder]: For program point L257(line 257) no Hoare annotation was computed. [2022-11-03 02:37:10,213 INFO L899 garLoopResultBuilder]: For program point L604(lines 604 628) no Hoare annotation was computed. [2022-11-03 02:37:10,214 INFO L899 garLoopResultBuilder]: For program point L26(lines 26 1000) no Hoare annotation was computed. [2022-11-03 02:37:10,214 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 105) no Hoare annotation was computed. [2022-11-03 02:37:10,214 INFO L899 garLoopResultBuilder]: For program point L819(lines 819 830) no Hoare annotation was computed. [2022-11-03 02:37:10,214 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 895) no Hoare annotation was computed. [2022-11-03 02:37:10,215 INFO L899 garLoopResultBuilder]: For program point L638(lines 638 967) no Hoare annotation was computed. [2022-11-03 02:37:10,215 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 219) no Hoare annotation was computed. [2022-11-03 02:37:10,215 INFO L899 garLoopResultBuilder]: For program point L919(line 919) no Hoare annotation was computed. [2022-11-03 02:37:10,215 INFO L899 garLoopResultBuilder]: For program point L853(lines 853 947) no Hoare annotation was computed. [2022-11-03 02:37:10,215 INFO L899 garLoopResultBuilder]: For program point L143(lines 143 236) no Hoare annotation was computed. [2022-11-03 02:37:10,216 INFO L899 garLoopResultBuilder]: For program point L589(lines 589 970) no Hoare annotation was computed. [2022-11-03 02:37:10,216 INFO L899 garLoopResultBuilder]: For program point L325(lines 325 993) no Hoare annotation was computed. [2022-11-03 02:37:10,216 INFO L899 garLoopResultBuilder]: For program point L672(lines 672 696) no Hoare annotation was computed. [2022-11-03 02:37:10,216 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 145) no Hoare annotation was computed. [2022-11-03 02:37:10,216 INFO L899 garLoopResultBuilder]: For program point L309(lines 309 995) no Hoare annotation was computed. [2022-11-03 02:37:10,217 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 931) no Hoare annotation was computed. [2022-11-03 02:37:10,217 INFO L895 garLoopResultBuilder]: At program point L904(lines 65 999) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~main__t~0#1|) (<= |ULTIMATE.start_main_~main__t~0#1| |ULTIMATE.start_main_~main__tagbuf_len~0#1|)) [2022-11-03 02:37:10,217 INFO L899 garLoopResultBuilder]: For program point L706(lines 706 961) no Hoare annotation was computed. [2022-11-03 02:37:10,217 INFO L899 garLoopResultBuilder]: For program point L343(lines 343 354) no Hoare annotation was computed. [2022-11-03 02:37:10,218 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 117) no Hoare annotation was computed. [2022-11-03 02:37:10,218 INFO L899 garLoopResultBuilder]: For program point L145(line 145) no Hoare annotation was computed. [2022-11-03 02:37:10,218 INFO L899 garLoopResultBuilder]: For program point L657(lines 657 964) no Hoare annotation was computed. [2022-11-03 02:37:10,218 INFO L899 garLoopResultBuilder]: For program point L46(lines 46 56) no Hoare annotation was computed. [2022-11-03 02:37:10,218 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 919) no Hoare annotation was computed. [2022-11-03 02:37:10,219 INFO L902 garLoopResultBuilder]: At program point L1004(lines 22 1005) the Hoare annotation is: true [2022-11-03 02:37:10,219 INFO L899 garLoopResultBuilder]: For program point L393(lines 393 987) no Hoare annotation was computed. [2022-11-03 02:37:10,219 INFO L899 garLoopResultBuilder]: For program point L740(lines 740 764) no Hoare annotation was computed. [2022-11-03 02:37:10,219 INFO L899 garLoopResultBuilder]: For program point L96(lines 96 285) no Hoare annotation was computed. [2022-11-03 02:37:10,219 INFO L899 garLoopResultBuilder]: For program point L377(lines 377 989) no Hoare annotation was computed. [2022-11-03 02:37:10,220 INFO L899 garLoopResultBuilder]: For program point L774(lines 774 955) no Hoare annotation was computed. [2022-11-03 02:37:10,220 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 157) no Hoare annotation was computed. [2022-11-03 02:37:10,220 INFO L899 garLoopResultBuilder]: For program point L411(lines 411 422) no Hoare annotation was computed. [2022-11-03 02:37:10,220 INFO L899 garLoopResultBuilder]: For program point L725(lines 725 958) no Hoare annotation was computed. [2022-11-03 02:37:10,220 INFO L899 garLoopResultBuilder]: For program point L48(line 48) no Hoare annotation was computed. [2022-11-03 02:37:10,221 INFO L899 garLoopResultBuilder]: For program point L461(lines 461 981) no Hoare annotation was computed. [2022-11-03 02:37:10,221 INFO L895 garLoopResultBuilder]: At program point L940(lines 858 947) the Hoare annotation is: (and (<= 9 |ULTIMATE.start_main_~main__t~0#1|) (<= |ULTIMATE.start_main_~main__t~0#1| |ULTIMATE.start_main_~main__tagbuf_len~0#1|)) [2022-11-03 02:37:10,221 INFO L899 garLoopResultBuilder]: For program point L874(lines 874 945) no Hoare annotation was computed. [2022-11-03 02:37:10,221 INFO L899 garLoopResultBuilder]: For program point L808(lines 808 832) no Hoare annotation was computed. [2022-11-03 02:37:10,221 INFO L899 garLoopResultBuilder]: For program point L164(lines 164 233) no Hoare annotation was computed. [2022-11-03 02:37:10,222 INFO L899 garLoopResultBuilder]: For program point L65(lines 65 999) no Hoare annotation was computed. [2022-11-03 02:37:10,222 INFO L899 garLoopResultBuilder]: For program point L445(lines 445 983) no Hoare annotation was computed. [2022-11-03 02:37:10,222 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 36) no Hoare annotation was computed. [2022-11-03 02:37:10,222 INFO L899 garLoopResultBuilder]: For program point L115(lines 115 123) no Hoare annotation was computed. [2022-11-03 02:37:10,222 INFO L899 garLoopResultBuilder]: For program point L842(lines 842 949) no Hoare annotation was computed. [2022-11-03 02:37:10,223 INFO L899 garLoopResultBuilder]: For program point L132(lines 132 284) no Hoare annotation was computed. [2022-11-03 02:37:10,223 INFO L899 garLoopResultBuilder]: For program point L479(lines 479 490) no Hoare annotation was computed. [2022-11-03 02:37:10,223 INFO L899 garLoopResultBuilder]: For program point L793(lines 793 952) no Hoare annotation was computed. [2022-11-03 02:37:10,223 INFO L899 garLoopResultBuilder]: For program point L248(lines 248 283) no Hoare annotation was computed. [2022-11-03 02:37:10,223 INFO L899 garLoopResultBuilder]: For program point L83(lines 83 286) no Hoare annotation was computed. [2022-11-03 02:37:10,224 INFO L899 garLoopResultBuilder]: For program point L529(lines 529 975) no Hoare annotation was computed. [2022-11-03 02:37:10,224 INFO L899 garLoopResultBuilder]: For program point L298(lines 298 997) no Hoare annotation was computed. [2022-11-03 02:37:10,224 INFO L899 garLoopResultBuilder]: For program point L34(lines 34 58) no Hoare annotation was computed. [2022-11-03 02:37:10,224 INFO L899 garLoopResultBuilder]: For program point L513(lines 513 977) no Hoare annotation was computed. [2022-11-03 02:37:10,224 INFO L899 garLoopResultBuilder]: For program point L893(lines 893 905) no Hoare annotation was computed. [2022-11-03 02:37:10,225 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 257) no Hoare annotation was computed. [2022-11-03 02:37:10,225 INFO L895 garLoopResultBuilder]: At program point L282(lines 132 284) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~main__t~0#1|) (not (<= |ULTIMATE.start_main_~main__tagbuf_len~0#1| |ULTIMATE.start_main_~main__t~0#1|))) [2022-11-03 02:37:10,225 INFO L899 garLoopResultBuilder]: For program point L183(lines 183 191) no Hoare annotation was computed. [2022-11-03 02:37:10,225 INFO L899 garLoopResultBuilder]: For program point L117(line 117) no Hoare annotation was computed. [2022-11-03 02:37:10,225 INFO L899 garLoopResultBuilder]: For program point L332(lines 332 356) no Hoare annotation was computed. [2022-11-03 02:37:10,226 INFO L899 garLoopResultBuilder]: For program point L547(lines 547 558) no Hoare annotation was computed. [2022-11-03 02:37:10,230 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:37:10,233 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-03 02:37:10,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 02:37:10 BoogieIcfgContainer [2022-11-03 02:37:10,258 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-03 02:37:10,259 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-03 02:37:10,259 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-03 02:37:10,259 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-03 02:37:10,260 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:37:01" (3/4) ... [2022-11-03 02:37:10,264 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-03 02:37:10,298 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2022-11-03 02:37:10,299 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-03 02:37:10,300 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-03 02:37:10,301 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-03 02:37:10,445 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46353719-bc8c-4664-8ea1-dfffeb438e8f/bin/utaipan-7li7fVZpFI/witness.graphml [2022-11-03 02:37:10,446 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-03 02:37:10,446 INFO L158 Benchmark]: Toolchain (without parser) took 11227.50ms. Allocated memory was 111.1MB in the beginning and 172.0MB in the end (delta: 60.8MB). Free memory was 71.0MB in the beginning and 103.5MB in the end (delta: -32.5MB). Peak memory consumption was 28.3MB. Max. memory is 16.1GB. [2022-11-03 02:37:10,447 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 111.1MB. Free memory is still 87.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 02:37:10,447 INFO L158 Benchmark]: CACSL2BoogieTranslator took 755.16ms. Allocated memory is still 111.1MB. Free memory was 70.8MB in the beginning and 75.3MB in the end (delta: -4.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-03 02:37:10,449 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.70ms. Allocated memory is still 111.1MB. Free memory was 75.0MB in the beginning and 71.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 02:37:10,449 INFO L158 Benchmark]: Boogie Preprocessor took 71.04ms. Allocated memory is still 111.1MB. Free memory was 71.8MB in the beginning and 69.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 02:37:10,449 INFO L158 Benchmark]: RCFGBuilder took 939.52ms. Allocated memory is still 111.1MB. Free memory was 69.4MB in the beginning and 82.3MB in the end (delta: -12.9MB). Peak memory consumption was 35.5MB. Max. memory is 16.1GB. [2022-11-03 02:37:10,451 INFO L158 Benchmark]: TraceAbstraction took 9193.93ms. Allocated memory was 111.1MB in the beginning and 172.0MB in the end (delta: 60.8MB). Free memory was 81.8MB in the beginning and 112.9MB in the end (delta: -31.1MB). Peak memory consumption was 99.9MB. Max. memory is 16.1GB. [2022-11-03 02:37:10,451 INFO L158 Benchmark]: Witness Printer took 186.95ms. Allocated memory is still 172.0MB. Free memory was 111.9MB in the beginning and 103.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-03 02:37:10,456 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.35ms. Allocated memory is still 111.1MB. Free memory is still 87.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 755.16ms. Allocated memory is still 111.1MB. Free memory was 70.8MB in the beginning and 75.3MB in the end (delta: -4.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.70ms. Allocated memory is still 111.1MB. Free memory was 75.0MB in the beginning and 71.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.04ms. Allocated memory is still 111.1MB. Free memory was 71.8MB in the beginning and 69.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 939.52ms. Allocated memory is still 111.1MB. Free memory was 69.4MB in the beginning and 82.3MB in the end (delta: -12.9MB). Peak memory consumption was 35.5MB. Max. memory is 16.1GB. * TraceAbstraction took 9193.93ms. Allocated memory was 111.1MB in the beginning and 172.0MB in the end (delta: 60.8MB). Free memory was 81.8MB in the beginning and 112.9MB in the end (delta: -31.1MB). Peak memory consumption was 99.9MB. Max. memory is 16.1GB. * Witness Printer took 186.95ms. Allocated memory is still 172.0MB. Free memory was 111.9MB in the beginning and 103.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 36]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 48]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 105]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 117]: 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: 173]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 185]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 207]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 219]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 257]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 269]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 883]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 895]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 919]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 931]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 118 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 9.1s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1554 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1554 mSDsluCounter, 2344 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1353 mSDsCounter, 340 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3554 IncrementalHoareTripleChecker+Invalid, 3894 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 340 mSolverCounterUnsat, 994 mSDtfsCounter, 3554 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 151 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=118occurred in iteration=0, InterpolantAutomatonStates: 114, 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, 19 MinimizatonAttempts, 119 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 16 NumberOfFragments, 31 HoareAnnotationTreeSize, 6 FomulaSimplifications, 4434 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 6 FomulaSimplificationsInter, 207 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 367 NumberOfCodeBlocks, 367 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 348 ConstructedInterpolants, 0 QuantifiedInterpolants, 1122 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 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 - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: 1 <= main__t && !(main__tagbuf_len <= main__t) - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: 0 <= main__t && main__t <= main__tagbuf_len - InvariantResult [Line: 858]: Loop Invariant Derived loop invariant: 9 <= main__t && main__t <= main__tagbuf_len - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: 1 <= main__t && main__t <= main__tagbuf_len - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-11-03 02:37:10,535 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_46353719-bc8c-4664-8ea1-dfffeb438e8f/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE