./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a14d9e4-8ca1-4127-ac1d-218729f0ab9f/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a14d9e4-8ca1-4127-ac1d-218729f0ab9f/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a14d9e4-8ca1-4127-ac1d-218729f0ab9f/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a14d9e4-8ca1-4127-ac1d-218729f0ab9f/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a14d9e4-8ca1-4127-ac1d-218729f0ab9f/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a14d9e4-8ca1-4127-ac1d-218729f0ab9f/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f5182ada4c25502e8c117aae65840c303a96073ec563a87f29fad662bee2286b --- 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-02 20:17:34,464 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:17:34,467 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:17:34,540 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:17:34,541 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:17:34,546 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:17:34,550 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:17:34,554 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:17:34,556 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:17:34,564 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:17:34,566 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:17:34,569 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:17:34,570 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:17:34,573 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:17:34,576 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:17:34,579 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:17:34,581 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:17:34,582 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:17:34,584 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:17:34,593 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:17:34,595 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:17:34,597 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:17:34,601 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:17:34,603 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:17:34,614 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:17:34,615 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:17:34,615 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:17:34,617 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:17:34,618 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:17:34,620 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:17:34,621 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:17:34,624 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:17:34,626 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:17:34,628 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:17:34,630 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:17:34,630 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:17:34,631 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:17:34,632 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:17:34,632 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:17:34,633 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:17:34,634 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:17:34,635 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a14d9e4-8ca1-4127-ac1d-218729f0ab9f/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:17:34,686 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:17:34,686 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:17:34,687 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:17:34,687 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:17:34,688 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:17:34,689 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:17:34,690 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:17:34,690 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:17:34,690 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:17:34,691 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:17:34,692 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:17:34,692 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:17:34,693 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:17:34,693 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:17:34,693 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:17:34,693 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:17:34,694 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:17:34,694 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:17:34,694 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:17:34,695 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:17:34,695 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:17:34,695 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:17:34,695 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:17:34,696 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:17:34,696 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:17:34,696 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:17:34,698 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:17:34,699 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:17:34,699 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:17:34,699 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:17:34,700 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:17:34,700 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:17:34,700 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:17:34,701 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_0a14d9e4-8ca1-4127-ac1d-218729f0ab9f/bin/uautomizer-Dbtcem3rbc/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_0a14d9e4-8ca1-4127-ac1d-218729f0ab9f/bin/uautomizer-Dbtcem3rbc Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f5182ada4c25502e8c117aae65840c303a96073ec563a87f29fad662bee2286b [2022-11-02 20:17:35,090 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:17:35,134 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:17:35,137 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:17:35,139 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:17:35,140 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:17:35,142 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a14d9e4-8ca1-4127-ac1d-218729f0ab9f/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c [2022-11-02 20:17:35,258 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a14d9e4-8ca1-4127-ac1d-218729f0ab9f/bin/uautomizer-Dbtcem3rbc/data/a35411864/90cd3d92001d4e5f9294f575f5f1cd10/FLAGbed9119d4 [2022-11-02 20:17:35,971 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:17:35,972 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a14d9e4-8ca1-4127-ac1d-218729f0ab9f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c [2022-11-02 20:17:35,989 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a14d9e4-8ca1-4127-ac1d-218729f0ab9f/bin/uautomizer-Dbtcem3rbc/data/a35411864/90cd3d92001d4e5f9294f575f5f1cd10/FLAGbed9119d4 [2022-11-02 20:17:36,240 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a14d9e4-8ca1-4127-ac1d-218729f0ab9f/bin/uautomizer-Dbtcem3rbc/data/a35411864/90cd3d92001d4e5f9294f575f5f1cd10 [2022-11-02 20:17:36,243 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:17:36,245 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:17:36,251 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:17:36,252 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:17:36,256 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:17:36,258 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:17:36" (1/1) ... [2022-11-02 20:17:36,259 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70632f98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:17:36, skipping insertion in model container [2022-11-02 20:17:36,260 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:17:36" (1/1) ... [2022-11-02 20:17:36,268 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:17:36,384 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:17:36,706 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_0a14d9e4-8ca1-4127-ac1d-218729f0ab9f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[901,914] [2022-11-02 20:17:36,715 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_0a14d9e4-8ca1-4127-ac1d-218729f0ab9f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[1116,1129] [2022-11-02 20:17:36,719 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_0a14d9e4-8ca1-4127-ac1d-218729f0ab9f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[1625,1638] [2022-11-02 20:17:36,729 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_0a14d9e4-8ca1-4127-ac1d-218729f0ab9f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[1840,1853] [2022-11-02 20:17:36,734 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_0a14d9e4-8ca1-4127-ac1d-218729f0ab9f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[2157,2170] [2022-11-02 20:17:36,739 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_0a14d9e4-8ca1-4127-ac1d-218729f0ab9f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[2372,2385] [2022-11-02 20:17:36,743 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_0a14d9e4-8ca1-4127-ac1d-218729f0ab9f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[2867,2880] [2022-11-02 20:17:36,746 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_0a14d9e4-8ca1-4127-ac1d-218729f0ab9f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[3082,3095] [2022-11-02 20:17:36,750 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_0a14d9e4-8ca1-4127-ac1d-218729f0ab9f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[3384,3397] [2022-11-02 20:17:36,757 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_0a14d9e4-8ca1-4127-ac1d-218729f0ab9f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[3602,3615] [2022-11-02 20:17:36,760 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_0a14d9e4-8ca1-4127-ac1d-218729f0ab9f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[3878,3891] [2022-11-02 20:17:36,764 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_0a14d9e4-8ca1-4127-ac1d-218729f0ab9f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[4096,4109] [2022-11-02 20:17:36,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_0a14d9e4-8ca1-4127-ac1d-218729f0ab9f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[4582,4595] [2022-11-02 20:17:36,773 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_0a14d9e4-8ca1-4127-ac1d-218729f0ab9f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[4800,4813] [2022-11-02 20:17:37,181 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_0a14d9e4-8ca1-4127-ac1d-218729f0ab9f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[47686,47699] [2022-11-02 20:17:37,187 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_0a14d9e4-8ca1-4127-ac1d-218729f0ab9f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[47907,47920] [2022-11-02 20:17:37,206 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:17:37,217 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:17:37,234 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_0a14d9e4-8ca1-4127-ac1d-218729f0ab9f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[901,914] [2022-11-02 20:17:37,235 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_0a14d9e4-8ca1-4127-ac1d-218729f0ab9f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[1116,1129] [2022-11-02 20:17:37,236 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_0a14d9e4-8ca1-4127-ac1d-218729f0ab9f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[1625,1638] [2022-11-02 20:17:37,237 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_0a14d9e4-8ca1-4127-ac1d-218729f0ab9f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[1840,1853] [2022-11-02 20:17:37,239 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_0a14d9e4-8ca1-4127-ac1d-218729f0ab9f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[2157,2170] [2022-11-02 20:17:37,240 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_0a14d9e4-8ca1-4127-ac1d-218729f0ab9f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[2372,2385] [2022-11-02 20:17:37,241 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_0a14d9e4-8ca1-4127-ac1d-218729f0ab9f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[2867,2880] [2022-11-02 20:17:37,243 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_0a14d9e4-8ca1-4127-ac1d-218729f0ab9f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[3082,3095] [2022-11-02 20:17:37,244 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_0a14d9e4-8ca1-4127-ac1d-218729f0ab9f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[3384,3397] [2022-11-02 20:17:37,246 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_0a14d9e4-8ca1-4127-ac1d-218729f0ab9f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[3602,3615] [2022-11-02 20:17:37,248 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_0a14d9e4-8ca1-4127-ac1d-218729f0ab9f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[3878,3891] [2022-11-02 20:17:37,249 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_0a14d9e4-8ca1-4127-ac1d-218729f0ab9f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[4096,4109] [2022-11-02 20:17:37,251 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_0a14d9e4-8ca1-4127-ac1d-218729f0ab9f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[4582,4595] [2022-11-02 20:17:37,252 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_0a14d9e4-8ca1-4127-ac1d-218729f0ab9f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[4800,4813] [2022-11-02 20:17:37,449 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_0a14d9e4-8ca1-4127-ac1d-218729f0ab9f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[47686,47699] [2022-11-02 20:17:37,454 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_0a14d9e4-8ca1-4127-ac1d-218729f0ab9f/sv-benchmarks/c/loop-invgen/apache-get-tag.i.p+nlh-reducer.c[47907,47920] [2022-11-02 20:17:37,469 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:17:37,486 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:17:37,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:17:37 WrapperNode [2022-11-02 20:17:37,487 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:17:37,488 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:17:37,488 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:17:37,488 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:17:37,498 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:17:37" (1/1) ... [2022-11-02 20:17:37,520 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:17:37" (1/1) ... [2022-11-02 20:17:37,650 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1692 [2022-11-02 20:17:37,651 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:17:37,652 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:17:37,652 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:17:37,652 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:17:37,663 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:17:37" (1/1) ... [2022-11-02 20:17:37,664 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:17:37" (1/1) ... [2022-11-02 20:17:37,670 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:17:37" (1/1) ... [2022-11-02 20:17:37,671 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:17:37" (1/1) ... [2022-11-02 20:17:37,696 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:17:37" (1/1) ... [2022-11-02 20:17:37,708 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:17:37" (1/1) ... [2022-11-02 20:17:37,713 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:17:37" (1/1) ... [2022-11-02 20:17:37,719 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:17:37" (1/1) ... [2022-11-02 20:17:37,728 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:17:37,730 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:17:37,730 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:17:37,730 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:17:37,731 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:17:37" (1/1) ... [2022-11-02 20:17:37,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:17:37,815 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a14d9e4-8ca1-4127-ac1d-218729f0ab9f/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:17:37,869 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a14d9e4-8ca1-4127-ac1d-218729f0ab9f/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:17:37,934 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a14d9e4-8ca1-4127-ac1d-218729f0ab9f/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:17:37,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:17:37,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:17:37,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:17:37,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:17:38,227 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:17:38,230 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:17:39,933 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:17:39,950 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:17:39,951 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-02 20:17:39,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:17:39 BoogieIcfgContainer [2022-11-02 20:17:39,954 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:17:39,958 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:17:39,959 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:17:39,963 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:17:39,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:17:36" (1/3) ... [2022-11-02 20:17:39,965 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a6cface and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:17:39, skipping insertion in model container [2022-11-02 20:17:39,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:17:37" (2/3) ... [2022-11-02 20:17:39,966 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a6cface and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:17:39, skipping insertion in model container [2022-11-02 20:17:39,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:17:39" (3/3) ... [2022-11-02 20:17:39,968 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+nlh-reducer.c [2022-11-02 20:17:39,992 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:17:39,993 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2022-11-02 20:17:40,087 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:17:40,100 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=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4715fcc7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:17:40,101 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-11-02 20:17:40,113 INFO L276 IsEmpty]: Start isEmpty. Operand has 304 states, 287 states have (on average 1.9686411149825784) internal successors, (565), 303 states have internal predecessors, (565), 0 states have call successors, (0), 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-02 20:17:40,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-02 20:17:40,128 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:17:40,129 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:17:40,129 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-02 20:17:40,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:17:40,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1804934597, now seen corresponding path program 1 times [2022-11-02 20:17:40,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:17:40,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609117295] [2022-11-02 20:17:40,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:17:40,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:17:40,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:40,605 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-02 20:17:40,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:17:40,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609117295] [2022-11-02 20:17:40,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609117295] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:17:40,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:17:40,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:17:40,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743337445] [2022-11-02 20:17:40,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:17:40,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:17:40,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:17:40,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:17:40,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:17:40,687 INFO L87 Difference]: Start difference. First operand has 304 states, 287 states have (on average 1.9686411149825784) internal successors, (565), 303 states have internal predecessors, (565), 0 states have call successors, (0), 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.75) internal successors, (7), 4 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-02 20:17:41,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:17:41,690 INFO L93 Difference]: Finished difference Result 315 states and 573 transitions. [2022-11-02 20:17:41,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:17:41,702 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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-02 20:17:41,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:17:41,722 INFO L225 Difference]: With dead ends: 315 [2022-11-02 20:17:41,725 INFO L226 Difference]: Without dead ends: 298 [2022-11-02 20:17:41,730 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-02 20:17:41,735 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 487 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:17:41,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 461 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-02 20:17:41,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2022-11-02 20:17:41,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2022-11-02 20:17:41,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 283 states have (on average 1.4876325088339222) internal successors, (421), 297 states have internal predecessors, (421), 0 states have call successors, (0), 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-02 20:17:41,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 421 transitions. [2022-11-02 20:17:41,848 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 421 transitions. Word has length 7 [2022-11-02 20:17:41,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:17:41,849 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 421 transitions. [2022-11-02 20:17:41,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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-02 20:17:41,850 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 421 transitions. [2022-11-02 20:17:41,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-02 20:17:41,851 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:17:41,851 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:17:41,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:17:41,852 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-02 20:17:41,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:17:41,853 INFO L85 PathProgramCache]: Analyzing trace with hash 118401710, now seen corresponding path program 1 times [2022-11-02 20:17:41,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:17:41,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066926585] [2022-11-02 20:17:41,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:17:41,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:17:41,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:42,036 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-02 20:17:42,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:17:42,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066926585] [2022-11-02 20:17:42,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066926585] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:17:42,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:17:42,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:17:42,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807185450] [2022-11-02 20:17:42,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:17:42,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:17:42,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:17:42,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:17:42,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:17:42,043 INFO L87 Difference]: Start difference. First operand 298 states and 421 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 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-02 20:17:42,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:17:42,783 INFO L93 Difference]: Finished difference Result 305 states and 428 transitions. [2022-11-02 20:17:42,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:17:42,785 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-11-02 20:17:42,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:17:42,787 INFO L225 Difference]: With dead ends: 305 [2022-11-02 20:17:42,787 INFO L226 Difference]: Without dead ends: 300 [2022-11-02 20:17:42,788 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-02 20:17:42,789 INFO L413 NwaCegarLoop]: 407 mSDtfsCounter, 44 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:17:42,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 900 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 20:17:42,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2022-11-02 20:17:42,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 293. [2022-11-02 20:17:42,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 279 states have (on average 1.2759856630824373) internal successors, (356), 292 states have internal predecessors, (356), 0 states have call successors, (0), 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-02 20:17:42,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 356 transitions. [2022-11-02 20:17:42,812 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 356 transitions. Word has length 8 [2022-11-02 20:17:42,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:17:42,813 INFO L495 AbstractCegarLoop]: Abstraction has 293 states and 356 transitions. [2022-11-02 20:17:42,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 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-02 20:17:42,813 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 356 transitions. [2022-11-02 20:17:42,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-02 20:17:42,814 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:17:42,814 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:17:42,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:17:42,815 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-02 20:17:42,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:17:42,816 INFO L85 PathProgramCache]: Analyzing trace with hash 137513629, now seen corresponding path program 1 times [2022-11-02 20:17:42,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:17:42,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311398711] [2022-11-02 20:17:42,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:17:42,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:17:42,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:42,909 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-02 20:17:42,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:17:42,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311398711] [2022-11-02 20:17:42,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311398711] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:17:42,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:17:42,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:17:42,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227372601] [2022-11-02 20:17:42,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:17:42,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:17:42,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:17:42,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:17:42,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:17:42,914 INFO L87 Difference]: Start difference. First operand 293 states and 356 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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-02 20:17:43,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:17:43,527 INFO L93 Difference]: Finished difference Result 293 states and 356 transitions. [2022-11-02 20:17:43,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:17:43,528 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-11-02 20:17:43,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:17:43,529 INFO L225 Difference]: With dead ends: 293 [2022-11-02 20:17:43,530 INFO L226 Difference]: Without dead ends: 291 [2022-11-02 20:17:43,530 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-02 20:17:43,532 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 325 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:17:43,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 166 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:17:43,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2022-11-02 20:17:43,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2022-11-02 20:17:43,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 278 states have (on average 1.2733812949640289) internal successors, (354), 290 states have internal predecessors, (354), 0 states have call successors, (0), 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-02 20:17:43,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 354 transitions. [2022-11-02 20:17:43,569 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 354 transitions. Word has length 8 [2022-11-02 20:17:43,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:17:43,569 INFO L495 AbstractCegarLoop]: Abstraction has 291 states and 354 transitions. [2022-11-02 20:17:43,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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-02 20:17:43,570 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 354 transitions. [2022-11-02 20:17:43,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 20:17:43,571 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:17:43,571 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:17:43,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:17:43,575 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-02 20:17:43,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:17:43,576 INFO L85 PathProgramCache]: Analyzing trace with hash -32040723, now seen corresponding path program 1 times [2022-11-02 20:17:43,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:17:43,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243301542] [2022-11-02 20:17:43,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:17:43,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:17:43,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:43,747 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-02 20:17:43,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:17:43,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243301542] [2022-11-02 20:17:43,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243301542] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:17:43,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:17:43,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:17:43,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465865348] [2022-11-02 20:17:43,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:17:43,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:17:43,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:17:43,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:17:43,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:17:43,752 INFO L87 Difference]: Start difference. First operand 291 states and 354 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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-02 20:17:44,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:17:44,248 INFO L93 Difference]: Finished difference Result 296 states and 359 transitions. [2022-11-02 20:17:44,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:17:44,249 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-11-02 20:17:44,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:17:44,251 INFO L225 Difference]: With dead ends: 296 [2022-11-02 20:17:44,251 INFO L226 Difference]: Without dead ends: 294 [2022-11-02 20:17:44,251 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-02 20:17:44,253 INFO L413 NwaCegarLoop]: 347 mSDtfsCounter, 41 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:17:44,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 747 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:17:44,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-11-02 20:17:44,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2022-11-02 20:17:44,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 281 states have (on average 1.2704626334519573) internal successors, (357), 293 states have internal predecessors, (357), 0 states have call successors, (0), 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-02 20:17:44,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 357 transitions. [2022-11-02 20:17:44,284 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 357 transitions. Word has length 9 [2022-11-02 20:17:44,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:17:44,285 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 357 transitions. [2022-11-02 20:17:44,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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-02 20:17:44,285 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 357 transitions. [2022-11-02 20:17:44,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:17:44,286 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:17:44,287 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:17:44,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:17:44,288 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-02 20:17:44,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:17:44,289 INFO L85 PathProgramCache]: Analyzing trace with hash -726236111, now seen corresponding path program 1 times [2022-11-02 20:17:44,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:17:44,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014202959] [2022-11-02 20:17:44,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:17:44,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:17:44,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:44,491 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-02 20:17:44,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:17:44,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014202959] [2022-11-02 20:17:44,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014202959] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:17:44,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:17:44,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:17:44,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141500633] [2022-11-02 20:17:44,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:17:44,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:17:44,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:17:44,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:17:44,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:17:44,495 INFO L87 Difference]: Start difference. First operand 294 states and 357 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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-02 20:17:45,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:17:45,292 INFO L93 Difference]: Finished difference Result 294 states and 357 transitions. [2022-11-02 20:17:45,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:17:45,293 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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-02 20:17:45,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:17:45,294 INFO L225 Difference]: With dead ends: 294 [2022-11-02 20:17:45,295 INFO L226 Difference]: Without dead ends: 292 [2022-11-02 20:17:45,295 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-02 20:17:45,296 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 287 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:17:45,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 278 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-02 20:17:45,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2022-11-02 20:17:45,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2022-11-02 20:17:45,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 280 states have (on average 1.2678571428571428) internal successors, (355), 291 states have internal predecessors, (355), 0 states have call successors, (0), 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-02 20:17:45,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 355 transitions. [2022-11-02 20:17:45,310 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 355 transitions. Word has length 11 [2022-11-02 20:17:45,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:17:45,311 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 355 transitions. [2022-11-02 20:17:45,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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-02 20:17:45,311 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 355 transitions. [2022-11-02 20:17:45,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-02 20:17:45,313 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:17:45,313 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:17:45,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:17:45,313 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:17:45,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:17:45,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1038478869, now seen corresponding path program 1 times [2022-11-02 20:17:45,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:17:45,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544590312] [2022-11-02 20:17:45,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:17:45,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:17:45,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:45,473 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-02 20:17:45,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:17:45,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544590312] [2022-11-02 20:17:45,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544590312] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:17:45,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:17:45,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:17:45,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258664780] [2022-11-02 20:17:45,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:17:45,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:17:45,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:17:45,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:17:45,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:17:45,494 INFO L87 Difference]: Start difference. First operand 292 states and 355 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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-02 20:17:45,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:17:45,909 INFO L93 Difference]: Finished difference Result 292 states and 355 transitions. [2022-11-02 20:17:45,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:17:45,909 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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-02 20:17:45,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:17:45,911 INFO L225 Difference]: With dead ends: 292 [2022-11-02 20:17:45,911 INFO L226 Difference]: Without dead ends: 288 [2022-11-02 20:17:45,912 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-02 20:17:45,913 INFO L413 NwaCegarLoop]: 341 mSDtfsCounter, 12 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:17:45,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 766 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:17:45,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2022-11-02 20:17:45,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2022-11-02 20:17:45,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 277 states have (on average 1.2671480144404332) internal successors, (351), 287 states have internal predecessors, (351), 0 states have call successors, (0), 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-02 20:17:45,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 351 transitions. [2022-11-02 20:17:45,934 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 351 transitions. Word has length 12 [2022-11-02 20:17:45,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:17:45,935 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 351 transitions. [2022-11-02 20:17:45,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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-02 20:17:45,938 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 351 transitions. [2022-11-02 20:17:45,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 20:17:45,940 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:17:45,940 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:17:45,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:17:45,941 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:17:45,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:17:45,942 INFO L85 PathProgramCache]: Analyzing trace with hash -242777879, now seen corresponding path program 1 times [2022-11-02 20:17:45,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:17:45,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584767526] [2022-11-02 20:17:45,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:17:45,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:17:45,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:46,235 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-02 20:17:46,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:17:46,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584767526] [2022-11-02 20:17:46,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584767526] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:17:46,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:17:46,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:17:46,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828796312] [2022-11-02 20:17:46,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:17:46,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:17:46,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:17:46,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:17:46,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:17:46,239 INFO L87 Difference]: Start difference. First operand 288 states and 351 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-02 20:17:46,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:17:46,859 INFO L93 Difference]: Finished difference Result 316 states and 381 transitions. [2022-11-02 20:17:46,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:17:46,860 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-02 20:17:46,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:17:46,861 INFO L225 Difference]: With dead ends: 316 [2022-11-02 20:17:46,861 INFO L226 Difference]: Without dead ends: 314 [2022-11-02 20:17:46,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:17:46,863 INFO L413 NwaCegarLoop]: 328 mSDtfsCounter, 91 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:17:46,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 825 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:17:46,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2022-11-02 20:17:46,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 288. [2022-11-02 20:17:46,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 277 states have (on average 1.2671480144404332) internal successors, (351), 287 states have internal predecessors, (351), 0 states have call successors, (0), 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-02 20:17:46,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 351 transitions. [2022-11-02 20:17:46,874 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 351 transitions. Word has length 13 [2022-11-02 20:17:46,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:17:46,874 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 351 transitions. [2022-11-02 20:17:46,875 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-02 20:17:46,875 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 351 transitions. [2022-11-02 20:17:46,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 20:17:46,876 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:17:46,876 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:17:46,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:17:46,877 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:17:46,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:17:46,877 INFO L85 PathProgramCache]: Analyzing trace with hash -2112927996, now seen corresponding path program 1 times [2022-11-02 20:17:46,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:17:46,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851038443] [2022-11-02 20:17:46,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:17:46,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:17:46,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:46,980 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-02 20:17:46,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:17:46,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851038443] [2022-11-02 20:17:46,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851038443] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:17:46,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:17:46,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:17:46,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063462432] [2022-11-02 20:17:46,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:17:46,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:17:46,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:17:46,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:17:46,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:17:46,990 INFO L87 Difference]: Start difference. First operand 288 states and 351 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-02 20:17:47,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:17:47,754 INFO L93 Difference]: Finished difference Result 308 states and 373 transitions. [2022-11-02 20:17:47,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:17:47,756 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-02 20:17:47,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:17:47,757 INFO L225 Difference]: With dead ends: 308 [2022-11-02 20:17:47,757 INFO L226 Difference]: Without dead ends: 306 [2022-11-02 20:17:47,758 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-02 20:17:47,759 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 303 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:17:47,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 286 Invalid, 854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 789 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 20:17:47,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-11-02 20:17:47,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 286. [2022-11-02 20:17:47,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 276 states have (on average 1.2644927536231885) internal successors, (349), 285 states have internal predecessors, (349), 0 states have call successors, (0), 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-02 20:17:47,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 349 transitions. [2022-11-02 20:17:47,774 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 349 transitions. Word has length 13 [2022-11-02 20:17:47,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:17:47,775 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 349 transitions. [2022-11-02 20:17:47,775 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-02 20:17:47,775 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 349 transitions. [2022-11-02 20:17:47,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 20:17:47,778 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:17:47,778 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:17:47,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:17:47,778 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:17:47,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:17:47,779 INFO L85 PathProgramCache]: Analyzing trace with hash -2111204092, now seen corresponding path program 1 times [2022-11-02 20:17:47,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:17:47,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834688815] [2022-11-02 20:17:47,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:17:47,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:17:47,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:47,887 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-02 20:17:47,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:17:47,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834688815] [2022-11-02 20:17:47,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834688815] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:17:47,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:17:47,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:17:47,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298155251] [2022-11-02 20:17:47,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:17:47,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:17:47,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:17:47,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:17:47,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:17:47,892 INFO L87 Difference]: Start difference. First operand 286 states and 349 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-02 20:17:48,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:17:48,606 INFO L93 Difference]: Finished difference Result 289 states and 352 transitions. [2022-11-02 20:17:48,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:17:48,606 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-02 20:17:48,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:17:48,608 INFO L225 Difference]: With dead ends: 289 [2022-11-02 20:17:48,608 INFO L226 Difference]: Without dead ends: 287 [2022-11-02 20:17:48,608 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-02 20:17:48,609 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 277 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:17:48,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 260 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 20:17:48,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-11-02 20:17:48,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 284. [2022-11-02 20:17:48,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 275 states have (on average 1.2618181818181817) internal successors, (347), 283 states have internal predecessors, (347), 0 states have call successors, (0), 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-02 20:17:48,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 347 transitions. [2022-11-02 20:17:48,627 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 347 transitions. Word has length 13 [2022-11-02 20:17:48,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:17:48,627 INFO L495 AbstractCegarLoop]: Abstraction has 284 states and 347 transitions. [2022-11-02 20:17:48,627 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-02 20:17:48,628 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 347 transitions. [2022-11-02 20:17:48,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-02 20:17:48,630 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:17:48,630 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:17:48,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:17:48,631 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:17:48,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:17:48,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1076254322, now seen corresponding path program 1 times [2022-11-02 20:17:48,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:17:48,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170560804] [2022-11-02 20:17:48,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:17:48,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:17:48,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:48,837 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-02 20:17:48,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:17:48,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170560804] [2022-11-02 20:17:48,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170560804] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:17:48,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:17:48,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:17:48,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854084776] [2022-11-02 20:17:48,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:17:48,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:17:48,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:17:48,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:17:48,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:17:48,841 INFO L87 Difference]: Start difference. First operand 284 states and 347 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-02 20:17:49,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:17:49,496 INFO L93 Difference]: Finished difference Result 322 states and 389 transitions. [2022-11-02 20:17:49,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:17:49,496 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-02 20:17:49,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:17:49,498 INFO L225 Difference]: With dead ends: 322 [2022-11-02 20:17:49,498 INFO L226 Difference]: Without dead ends: 320 [2022-11-02 20:17:49,499 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-02 20:17:49,500 INFO L413 NwaCegarLoop]: 342 mSDtfsCounter, 55 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:17:49,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 842 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:17:49,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2022-11-02 20:17:49,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 292. [2022-11-02 20:17:49,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 283 states have (on average 1.2614840989399294) internal successors, (357), 291 states have internal predecessors, (357), 0 states have call successors, (0), 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-02 20:17:49,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 357 transitions. [2022-11-02 20:17:49,514 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 357 transitions. Word has length 14 [2022-11-02 20:17:49,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:17:49,514 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 357 transitions. [2022-11-02 20:17:49,514 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-02 20:17:49,515 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 357 transitions. [2022-11-02 20:17:49,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-02 20:17:49,515 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:17:49,516 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:17:49,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:17:49,516 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:17:49,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:17:49,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1074707177, now seen corresponding path program 1 times [2022-11-02 20:17:49,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:17:49,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480410343] [2022-11-02 20:17:49,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:17:49,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:17:49,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:49,587 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-02 20:17:49,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:17:49,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480410343] [2022-11-02 20:17:49,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480410343] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:17:49,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:17:49,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:17:49,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577748387] [2022-11-02 20:17:49,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:17:49,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:17:49,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:17:49,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:17:49,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:17:49,591 INFO L87 Difference]: Start difference. First operand 292 states and 357 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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-02 20:17:50,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:17:50,324 INFO L93 Difference]: Finished difference Result 312 states and 379 transitions. [2022-11-02 20:17:50,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:17:50,324 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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-02 20:17:50,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:17:50,327 INFO L225 Difference]: With dead ends: 312 [2022-11-02 20:17:50,328 INFO L226 Difference]: Without dead ends: 310 [2022-11-02 20:17:50,328 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-02 20:17:50,329 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 294 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:17:50,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 278 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 798 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 20:17:50,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2022-11-02 20:17:50,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 290. [2022-11-02 20:17:50,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 282 states have (on average 1.2588652482269505) internal successors, (355), 289 states have internal predecessors, (355), 0 states have call successors, (0), 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-02 20:17:50,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 355 transitions. [2022-11-02 20:17:50,366 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 355 transitions. Word has length 14 [2022-11-02 20:17:50,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:17:50,366 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 355 transitions. [2022-11-02 20:17:50,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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-02 20:17:50,367 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 355 transitions. [2022-11-02 20:17:50,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-02 20:17:50,370 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:17:50,370 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:17:50,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:17:50,371 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:17:50,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:17:50,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1022813242, now seen corresponding path program 1 times [2022-11-02 20:17:50,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:17:50,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887705566] [2022-11-02 20:17:50,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:17:50,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:17:50,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:50,562 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-02 20:17:50,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:17:50,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887705566] [2022-11-02 20:17:50,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887705566] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:17:50,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:17:50,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:17:50,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739921582] [2022-11-02 20:17:50,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:17:50,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:17:50,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:17:50,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:17:50,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:17:50,565 INFO L87 Difference]: Start difference. First operand 290 states and 355 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-02 20:17:51,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:17:51,160 INFO L93 Difference]: Finished difference Result 300 states and 365 transitions. [2022-11-02 20:17:51,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:17:51,161 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-02 20:17:51,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:17:51,162 INFO L225 Difference]: With dead ends: 300 [2022-11-02 20:17:51,162 INFO L226 Difference]: Without dead ends: 296 [2022-11-02 20:17:51,163 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-02 20:17:51,164 INFO L413 NwaCegarLoop]: 322 mSDtfsCounter, 29 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:17:51,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 807 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:17:51,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-11-02 20:17:51,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 291. [2022-11-02 20:17:51,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 283 states have (on average 1.2579505300353357) internal successors, (356), 290 states have internal predecessors, (356), 0 states have call successors, (0), 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-02 20:17:51,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 356 transitions. [2022-11-02 20:17:51,175 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 356 transitions. Word has length 14 [2022-11-02 20:17:51,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:17:51,176 INFO L495 AbstractCegarLoop]: Abstraction has 291 states and 356 transitions. [2022-11-02 20:17:51,176 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-02 20:17:51,176 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 356 transitions. [2022-11-02 20:17:51,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-02 20:17:51,177 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:17:51,177 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:17:51,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:17:51,178 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:17:51,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:17:51,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1043820030, now seen corresponding path program 1 times [2022-11-02 20:17:51,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:17:51,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380104018] [2022-11-02 20:17:51,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:17:51,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:17:51,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:51,329 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-02 20:17:51,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:17:51,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380104018] [2022-11-02 20:17:51,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380104018] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:17:51,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:17:51,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:17:51,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192867405] [2022-11-02 20:17:51,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:17:51,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:17:51,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:17:51,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:17:51,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:17:51,332 INFO L87 Difference]: Start difference. First operand 291 states and 356 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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-02 20:17:52,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:17:52,147 INFO L93 Difference]: Finished difference Result 317 states and 384 transitions. [2022-11-02 20:17:52,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:17:52,147 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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-02 20:17:52,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:17:52,149 INFO L225 Difference]: With dead ends: 317 [2022-11-02 20:17:52,149 INFO L226 Difference]: Without dead ends: 315 [2022-11-02 20:17:52,150 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-02 20:17:52,151 INFO L413 NwaCegarLoop]: 347 mSDtfsCounter, 42 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 831 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:17:52,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 953 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 831 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-02 20:17:52,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2022-11-02 20:17:52,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 294. [2022-11-02 20:17:52,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 286 states have (on average 1.2552447552447552) internal successors, (359), 293 states have internal predecessors, (359), 0 states have call successors, (0), 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-02 20:17:52,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 359 transitions. [2022-11-02 20:17:52,163 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 359 transitions. Word has length 15 [2022-11-02 20:17:52,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:17:52,163 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 359 transitions. [2022-11-02 20:17:52,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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-02 20:17:52,164 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 359 transitions. [2022-11-02 20:17:52,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:17:52,165 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:17:52,165 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:17:52,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:17:52,165 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:17:52,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:17:52,166 INFO L85 PathProgramCache]: Analyzing trace with hash 806842801, now seen corresponding path program 1 times [2022-11-02 20:17:52,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:17:52,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155296071] [2022-11-02 20:17:52,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:17:52,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:17:52,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:52,236 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-02 20:17:52,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:17:52,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155296071] [2022-11-02 20:17:52,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155296071] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:17:52,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:17:52,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:17:52,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172108128] [2022-11-02 20:17:52,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:17:52,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:17:52,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:17:52,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:17:52,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:17:52,239 INFO L87 Difference]: Start difference. First operand 294 states and 359 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-02 20:17:52,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:17:52,507 INFO L93 Difference]: Finished difference Result 294 states and 359 transitions. [2022-11-02 20:17:52,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:17:52,507 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-02 20:17:52,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:17:52,509 INFO L225 Difference]: With dead ends: 294 [2022-11-02 20:17:52,509 INFO L226 Difference]: Without dead ends: 292 [2022-11-02 20:17:52,509 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-02 20:17:52,510 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 330 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:17:52,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 420 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:17:52,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2022-11-02 20:17:52,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2022-11-02 20:17:52,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 285 states have (on average 1.2526315789473683) internal successors, (357), 291 states have internal predecessors, (357), 0 states have call successors, (0), 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-02 20:17:52,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 357 transitions. [2022-11-02 20:17:52,522 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 357 transitions. Word has length 16 [2022-11-02 20:17:52,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:17:52,523 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 357 transitions. [2022-11-02 20:17:52,523 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-02 20:17:52,523 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 357 transitions. [2022-11-02 20:17:52,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-02 20:17:52,524 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:17:52,524 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:17:52,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:17:52,525 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:17:52,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:17:52,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1029635725, now seen corresponding path program 1 times [2022-11-02 20:17:52,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:17:52,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948573280] [2022-11-02 20:17:52,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:17:52,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:17:52,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:52,674 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-02 20:17:52,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:17:52,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948573280] [2022-11-02 20:17:52,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948573280] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:17:52,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:17:52,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:17:52,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442344245] [2022-11-02 20:17:52,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:17:52,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:17:52,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:17:52,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:17:52,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:17:52,677 INFO L87 Difference]: Start difference. First operand 292 states and 357 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-02 20:17:53,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:17:53,535 INFO L93 Difference]: Finished difference Result 292 states and 357 transitions. [2022-11-02 20:17:53,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:17:53,536 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-02 20:17:53,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:17:53,538 INFO L225 Difference]: With dead ends: 292 [2022-11-02 20:17:53,538 INFO L226 Difference]: Without dead ends: 290 [2022-11-02 20:17:53,538 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-02 20:17:53,539 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 496 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:17:53,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 158 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-02 20:17:53,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2022-11-02 20:17:53,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 287. [2022-11-02 20:17:53,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 281 states have (on average 1.2526690391459074) internal successors, (352), 286 states have internal predecessors, (352), 0 states have call successors, (0), 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-02 20:17:53,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 352 transitions. [2022-11-02 20:17:53,555 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 352 transitions. Word has length 17 [2022-11-02 20:17:53,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:17:53,555 INFO L495 AbstractCegarLoop]: Abstraction has 287 states and 352 transitions. [2022-11-02 20:17:53,556 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-02 20:17:53,556 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 352 transitions. [2022-11-02 20:17:53,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-02 20:17:53,556 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:17:53,557 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:17:53,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:17:53,558 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:17:53,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:17:53,558 INFO L85 PathProgramCache]: Analyzing trace with hash -757672814, now seen corresponding path program 1 times [2022-11-02 20:17:53,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:17:53,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980507004] [2022-11-02 20:17:53,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:17:53,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:17:53,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:53,625 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-02 20:17:53,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:17:53,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980507004] [2022-11-02 20:17:53,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980507004] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:17:53,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:17:53,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:17:53,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197470051] [2022-11-02 20:17:53,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:17:53,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:17:53,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:17:53,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:17:53,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:17:53,634 INFO L87 Difference]: Start difference. First operand 287 states and 352 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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-02 20:17:54,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:17:54,016 INFO L93 Difference]: Finished difference Result 287 states and 352 transitions. [2022-11-02 20:17:54,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:17:54,017 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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-02 20:17:54,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:17:54,019 INFO L225 Difference]: With dead ends: 287 [2022-11-02 20:17:54,019 INFO L226 Difference]: Without dead ends: 283 [2022-11-02 20:17:54,019 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-02 20:17:54,020 INFO L413 NwaCegarLoop]: 328 mSDtfsCounter, 7 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:17:54,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 732 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:17:54,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-11-02 20:17:54,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2022-11-02 20:17:54,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 278 states have (on average 1.2517985611510791) internal successors, (348), 282 states have internal predecessors, (348), 0 states have call successors, (0), 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-02 20:17:54,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 348 transitions. [2022-11-02 20:17:54,034 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 348 transitions. Word has length 17 [2022-11-02 20:17:54,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:17:54,035 INFO L495 AbstractCegarLoop]: Abstraction has 283 states and 348 transitions. [2022-11-02 20:17:54,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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-02 20:17:54,035 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 348 transitions. [2022-11-02 20:17:54,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-02 20:17:54,036 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:17:54,036 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:17:54,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:17:54,037 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:17:54,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:17:54,037 INFO L85 PathProgramCache]: Analyzing trace with hash -476651758, now seen corresponding path program 1 times [2022-11-02 20:17:54,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:17:54,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636071970] [2022-11-02 20:17:54,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:17:54,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:17:54,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:54,217 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-02 20:17:54,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:17:54,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636071970] [2022-11-02 20:17:54,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636071970] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:17:54,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:17:54,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:17:54,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935065490] [2022-11-02 20:17:54,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:17:54,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:17:54,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:17:54,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:17:54,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:17:54,221 INFO L87 Difference]: Start difference. First operand 283 states and 348 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 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-02 20:17:54,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:17:54,978 INFO L93 Difference]: Finished difference Result 297 states and 364 transitions. [2022-11-02 20:17:54,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:17:54,979 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2022-11-02 20:17:54,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:17:54,980 INFO L225 Difference]: With dead ends: 297 [2022-11-02 20:17:54,980 INFO L226 Difference]: Without dead ends: 295 [2022-11-02 20:17:54,981 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-02 20:17:54,982 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 485 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:17:54,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 164 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 647 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 20:17:54,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2022-11-02 20:17:54,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 279. [2022-11-02 20:17:54,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 275 states have (on average 1.250909090909091) internal successors, (344), 278 states have internal predecessors, (344), 0 states have call successors, (0), 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-02 20:17:54,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 344 transitions. [2022-11-02 20:17:54,994 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 344 transitions. Word has length 18 [2022-11-02 20:17:54,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:17:54,995 INFO L495 AbstractCegarLoop]: Abstraction has 279 states and 344 transitions. [2022-11-02 20:17:54,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 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-02 20:17:54,995 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 344 transitions. [2022-11-02 20:17:54,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-02 20:17:54,996 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:17:54,996 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:17:54,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:17:54,997 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-02 20:17:54,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:17:54,997 INFO L85 PathProgramCache]: Analyzing trace with hash -423210678, now seen corresponding path program 1 times [2022-11-02 20:17:54,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:17:54,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471393098] [2022-11-02 20:17:54,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:17:54,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:17:55,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:55,140 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-02 20:17:55,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:17:55,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471393098] [2022-11-02 20:17:55,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471393098] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:17:55,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:17:55,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:17:55,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6738815] [2022-11-02 20:17:55,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:17:55,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:17:55,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:17:55,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:17:55,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:17:55,143 INFO L87 Difference]: Start difference. First operand 279 states and 344 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 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-02 20:17:55,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:17:55,826 INFO L93 Difference]: Finished difference Result 279 states and 344 transitions. [2022-11-02 20:17:55,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:17:55,827 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2022-11-02 20:17:55,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:17:55,828 INFO L225 Difference]: With dead ends: 279 [2022-11-02 20:17:55,829 INFO L226 Difference]: Without dead ends: 275 [2022-11-02 20:17:55,829 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-02 20:17:55,830 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 660 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:17:55,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 153 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:17:55,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-11-02 20:17:55,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2022-11-02 20:17:55,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 272 states have (on average 1.25) internal successors, (340), 274 states have internal predecessors, (340), 0 states have call successors, (0), 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-02 20:17:55,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 340 transitions. [2022-11-02 20:17:55,844 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 340 transitions. Word has length 18 [2022-11-02 20:17:55,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:17:55,844 INFO L495 AbstractCegarLoop]: Abstraction has 275 states and 340 transitions. [2022-11-02 20:17:55,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 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-02 20:17:55,845 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 340 transitions. [2022-11-02 20:17:55,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-02 20:17:55,846 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:17:55,846 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:17:55,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 20:17:55,847 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:17:55,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:17:55,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1997901656, now seen corresponding path program 1 times [2022-11-02 20:17:55,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:17:55,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286688946] [2022-11-02 20:17:55,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:17:55,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:17:55,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:17:56,028 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-02 20:17:56,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:17:56,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286688946] [2022-11-02 20:17:56,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286688946] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:17:56,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:17:56,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:17:56,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676711405] [2022-11-02 20:17:56,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:17:56,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:17:56,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:17:56,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:17:56,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:17:56,033 INFO L87 Difference]: Start difference. First operand 275 states and 340 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 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-02 20:17:56,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:17:56,725 INFO L93 Difference]: Finished difference Result 284 states and 351 transitions. [2022-11-02 20:17:56,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:17:56,726 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2022-11-02 20:17:56,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:17:56,727 INFO L225 Difference]: With dead ends: 284 [2022-11-02 20:17:56,727 INFO L226 Difference]: Without dead ends: 250 [2022-11-02 20:17:56,728 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-02 20:17:56,735 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 464 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:17:56,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 154 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:17:56,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2022-11-02 20:17:56,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2022-11-02 20:17:56,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 248 states have (on average 1.0080645161290323) internal successors, (250), 249 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:17:56,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 250 transitions. [2022-11-02 20:17:56,745 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 250 transitions. Word has length 18 [2022-11-02 20:17:56,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:17:56,745 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 250 transitions. [2022-11-02 20:17:56,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 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-02 20:17:56,745 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 250 transitions. [2022-11-02 20:17:56,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2022-11-02 20:17:56,754 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:17:56,755 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 20:17:56,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 20:17:56,756 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:17:56,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:17:56,757 INFO L85 PathProgramCache]: Analyzing trace with hash -707619029, now seen corresponding path program 1 times [2022-11-02 20:17:56,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:17:56,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104007572] [2022-11-02 20:17:56,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:17:56,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:17:56,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:04,231 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-02 20:18:04,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:18:04,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104007572] [2022-11-02 20:18:04,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104007572] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:18:04,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:18:04,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [63] imperfect sequences [] total 63 [2022-11-02 20:18:04,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778333186] [2022-11-02 20:18:04,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:18:04,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-11-02 20:18:04,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:18:04,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-11-02 20:18:04,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1834, Invalid=2072, Unknown=0, NotChecked=0, Total=3906 [2022-11-02 20:18:04,241 INFO L87 Difference]: Start difference. First operand 250 states and 250 transitions. Second operand has 63 states, 63 states have (on average 3.873015873015873) internal successors, (244), 63 states have internal predecessors, (244), 0 states have call successors, (0), 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-02 20:18:05,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:18:05,481 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2022-11-02 20:18:05,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-11-02 20:18:05,482 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 3.873015873015873) internal successors, (244), 63 states have internal predecessors, (244), 0 states have call successors, (0), 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 244 [2022-11-02 20:18:05,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:18:05,484 INFO L225 Difference]: With dead ends: 251 [2022-11-02 20:18:05,485 INFO L226 Difference]: Without dead ends: 249 [2022-11-02 20:18:05,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1896, Invalid=2136, Unknown=0, NotChecked=0, Total=4032 [2022-11-02 20:18:05,489 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 547 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 1793 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 1974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 1793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:18:05,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 20 Invalid, 1974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 1793 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-02 20:18:05,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-11-02 20:18:05,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 248. [2022-11-02 20:18:05,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 247 states have (on average 1.0040485829959513) internal successors, (248), 247 states have internal predecessors, (248), 0 states have call successors, (0), 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-02 20:18:05,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 248 transitions. [2022-11-02 20:18:05,504 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 248 transitions. Word has length 244 [2022-11-02 20:18:05,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:18:05,506 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 248 transitions. [2022-11-02 20:18:05,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 3.873015873015873) internal successors, (244), 63 states have internal predecessors, (244), 0 states have call successors, (0), 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-02 20:18:05,507 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 248 transitions. [2022-11-02 20:18:05,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2022-11-02 20:18:05,510 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:18:05,511 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 20:18:05,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 20:18:05,511 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2022-11-02 20:18:05,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:18:05,512 INFO L85 PathProgramCache]: Analyzing trace with hash -461348049, now seen corresponding path program 1 times [2022-11-02 20:18:05,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:18:05,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325525473] [2022-11-02 20:18:05,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:18:05,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:18:06,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:18:16,947 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-02 20:18:16,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:18:16,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325525473] [2022-11-02 20:18:16,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325525473] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:18:16,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:18:16,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:18:16,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949702808] [2022-11-02 20:18:16,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:18:16,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:18:16,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:18:16,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:18:16,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:18:16,952 INFO L87 Difference]: Start difference. First operand 248 states and 248 transitions. Second operand has 7 states, 7 states have (on average 35.0) internal successors, (245), 7 states have internal predecessors, (245), 0 states have call successors, (0), 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-02 20:18:17,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:18:17,570 INFO L93 Difference]: Finished difference Result 250 states and 250 transitions. [2022-11-02 20:18:17,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:18:17,571 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 35.0) internal successors, (245), 7 states have internal predecessors, (245), 0 states have call successors, (0), 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 245 [2022-11-02 20:18:17,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:18:17,572 INFO L225 Difference]: With dead ends: 250 [2022-11-02 20:18:17,572 INFO L226 Difference]: Without dead ends: 0 [2022-11-02 20:18:17,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:18:17,574 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 424 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:18:17,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 10 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:18:17,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-02 20:18:17,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-02 20:18:17,575 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-02 20:18:17,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-02 20:18:17,575 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 245 [2022-11-02 20:18:17,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:18:17,575 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-02 20:18:17,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 35.0) internal successors, (245), 7 states have internal predecessors, (245), 0 states have call successors, (0), 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-02 20:18:17,576 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-02 20:18:17,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-02 20:18:17,581 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (15 of 16 remaining) [2022-11-02 20:18:17,582 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (14 of 16 remaining) [2022-11-02 20:18:17,583 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (13 of 16 remaining) [2022-11-02 20:18:17,583 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (12 of 16 remaining) [2022-11-02 20:18:17,583 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (11 of 16 remaining) [2022-11-02 20:18:17,584 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (10 of 16 remaining) [2022-11-02 20:18:17,584 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (9 of 16 remaining) [2022-11-02 20:18:17,584 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (8 of 16 remaining) [2022-11-02 20:18:17,585 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (7 of 16 remaining) [2022-11-02 20:18:17,585 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (6 of 16 remaining) [2022-11-02 20:18:17,585 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (5 of 16 remaining) [2022-11-02 20:18:17,587 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (4 of 16 remaining) [2022-11-02 20:18:17,588 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (3 of 16 remaining) [2022-11-02 20:18:17,588 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (2 of 16 remaining) [2022-11-02 20:18:17,589 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (1 of 16 remaining) [2022-11-02 20:18:17,589 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (0 of 16 remaining) [2022-11-02 20:18:17,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 20:18:17,592 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-02 20:18:19,575 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 47) no Hoare annotation was computed. [2022-11-02 20:18:19,575 INFO L899 garLoopResultBuilder]: For program point L1555(lines 1555 2805) no Hoare annotation was computed. [2022-11-02 20:18:19,575 INFO L899 garLoopResultBuilder]: For program point L2546(lines 2546 2653) no Hoare annotation was computed. [2022-11-02 20:18:19,575 INFO L899 garLoopResultBuilder]: For program point L2480(lines 2480 2663) no Hoare annotation was computed. [2022-11-02 20:18:19,575 INFO L899 garLoopResultBuilder]: For program point L432(lines 432 2978) no Hoare annotation was computed. [2022-11-02 20:18:19,576 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 255) no Hoare annotation was computed. [2022-11-02 20:18:19,576 INFO L899 garLoopResultBuilder]: For program point L697(lines 697 2937) no Hoare annotation was computed. [2022-11-02 20:18:19,576 INFO L899 garLoopResultBuilder]: For program point L1688(lines 1688 2785) no Hoare annotation was computed. [2022-11-02 20:18:19,576 INFO L899 garLoopResultBuilder]: For program point L1622(lines 1622 2795) no Hoare annotation was computed. [2022-11-02 20:18:19,576 INFO L899 garLoopResultBuilder]: For program point L103(lines 103 125) no Hoare annotation was computed. [2022-11-02 20:18:19,576 INFO L899 garLoopResultBuilder]: For program point L1953(lines 1953 2744) no Hoare annotation was computed. [2022-11-02 20:18:19,576 INFO L899 garLoopResultBuilder]: For program point L830(lines 830 2917) no Hoare annotation was computed. [2022-11-02 20:18:19,577 INFO L899 garLoopResultBuilder]: For program point L764(lines 764 2927) no Hoare annotation was computed. [2022-11-02 20:18:19,577 INFO L899 garLoopResultBuilder]: For program point L2614(lines 2614 2643) no Hoare annotation was computed. [2022-11-02 20:18:19,577 INFO L899 garLoopResultBuilder]: For program point L2218(lines 2218 2703) no Hoare annotation was computed. [2022-11-02 20:18:19,577 INFO L899 garLoopResultBuilder]: For program point L1095(lines 1095 2876) no Hoare annotation was computed. [2022-11-02 20:18:19,577 INFO L899 garLoopResultBuilder]: For program point L1360(lines 1360 2835) no Hoare annotation was computed. [2022-11-02 20:18:19,577 INFO L899 garLoopResultBuilder]: For program point L2351(lines 2351 2683) no Hoare annotation was computed. [2022-11-02 20:18:19,577 INFO L899 garLoopResultBuilder]: For program point L2285(lines 2285 2693) no Hoare annotation was computed. [2022-11-02 20:18:19,578 INFO L899 garLoopResultBuilder]: For program point L171(lines 171 193) no Hoare annotation was computed. [2022-11-02 20:18:19,578 INFO L899 garLoopResultBuilder]: For program point L105(line 105) no Hoare annotation was computed. [2022-11-02 20:18:19,578 INFO L899 garLoopResultBuilder]: For program point L2616(line 2616) no Hoare annotation was computed. [2022-11-02 20:18:19,578 INFO L899 garLoopResultBuilder]: For program point L502(lines 502 2967) no Hoare annotation was computed. [2022-11-02 20:18:19,578 INFO L899 garLoopResultBuilder]: For program point L1493(lines 1493 2815) no Hoare annotation was computed. [2022-11-02 20:18:19,578 INFO L899 garLoopResultBuilder]: For program point L1427(lines 1427 2825) no Hoare annotation was computed. [2022-11-02 20:18:19,578 INFO L899 garLoopResultBuilder]: For program point L1758(lines 1758 2774) no Hoare annotation was computed. [2022-11-02 20:18:19,578 INFO L899 garLoopResultBuilder]: For program point L635(lines 635 2947) no Hoare annotation was computed. [2022-11-02 20:18:19,579 INFO L899 garLoopResultBuilder]: For program point L569(lines 569 2957) no Hoare annotation was computed. [2022-11-02 20:18:19,579 INFO L902 garLoopResultBuilder]: At program point L2617(lines 16 3008) the Hoare annotation is: true [2022-11-02 20:18:19,579 INFO L899 garLoopResultBuilder]: For program point L173(line 173) no Hoare annotation was computed. [2022-11-02 20:18:19,579 INFO L899 garLoopResultBuilder]: For program point L2023(lines 2023 2733) no Hoare annotation was computed. [2022-11-02 20:18:19,579 INFO L899 garLoopResultBuilder]: For program point L900(lines 900 2906) no Hoare annotation was computed. [2022-11-02 20:18:19,579 INFO L899 garLoopResultBuilder]: For program point L1165(lines 1165 2865) no Hoare annotation was computed. [2022-11-02 20:18:19,580 INFO L899 garLoopResultBuilder]: For program point L2156(lines 2156 2713) no Hoare annotation was computed. [2022-11-02 20:18:19,580 INFO L899 garLoopResultBuilder]: For program point L2090(lines 2090 2723) no Hoare annotation was computed. [2022-11-02 20:18:19,580 INFO L899 garLoopResultBuilder]: For program point L2421(lines 2421 2672) no Hoare annotation was computed. [2022-11-02 20:18:19,580 INFO L899 garLoopResultBuilder]: For program point L307(lines 307 2997) no Hoare annotation was computed. [2022-11-02 20:18:19,580 INFO L899 garLoopResultBuilder]: For program point L1298(lines 1298 2845) no Hoare annotation was computed. [2022-11-02 20:18:19,580 INFO L899 garLoopResultBuilder]: For program point L1232(lines 1232 2855) no Hoare annotation was computed. [2022-11-02 20:18:19,580 INFO L899 garLoopResultBuilder]: For program point L1563(lines 1563 2804) no Hoare annotation was computed. [2022-11-02 20:18:19,580 INFO L899 garLoopResultBuilder]: For program point L440(lines 440 2977) no Hoare annotation was computed. [2022-11-02 20:18:19,583 INFO L899 garLoopResultBuilder]: For program point L374(lines 374 2987) no Hoare annotation was computed. [2022-11-02 20:18:19,583 INFO L899 garLoopResultBuilder]: For program point L1828(lines 1828 2763) no Hoare annotation was computed. [2022-11-02 20:18:19,583 INFO L899 garLoopResultBuilder]: For program point L705(lines 705 2936) no Hoare annotation was computed. [2022-11-02 20:18:19,583 INFO L899 garLoopResultBuilder]: For program point L45(lines 45 55) no Hoare annotation was computed. [2022-11-02 20:18:19,583 INFO L899 garLoopResultBuilder]: For program point L970(lines 970 2895) no Hoare annotation was computed. [2022-11-02 20:18:19,584 INFO L899 garLoopResultBuilder]: For program point L1961(lines 1961 2743) no Hoare annotation was computed. [2022-11-02 20:18:19,584 INFO L899 garLoopResultBuilder]: For program point L1895(lines 1895 2753) no Hoare annotation was computed. [2022-11-02 20:18:19,584 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 88) no Hoare annotation was computed. [2022-11-02 20:18:19,585 INFO L899 garLoopResultBuilder]: For program point L2226(lines 2226 2702) no Hoare annotation was computed. [2022-11-02 20:18:19,585 INFO L899 garLoopResultBuilder]: For program point L1103(lines 1103 2875) no Hoare annotation was computed. [2022-11-02 20:18:19,585 INFO L899 garLoopResultBuilder]: For program point L1037(lines 1037 2885) no Hoare annotation was computed. [2022-11-02 20:18:19,585 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 2604) no Hoare annotation was computed. [2022-11-02 20:18:19,585 INFO L899 garLoopResultBuilder]: For program point L2623(lines 2623 2642) no Hoare annotation was computed. [2022-11-02 20:18:19,585 INFO L899 garLoopResultBuilder]: For program point L2491(lines 2491 2661) no Hoare annotation was computed. [2022-11-02 20:18:19,585 INFO L899 garLoopResultBuilder]: For program point L1368(lines 1368 2834) no Hoare annotation was computed. [2022-11-02 20:18:19,586 INFO L899 garLoopResultBuilder]: For program point L47(line 47) no Hoare annotation was computed. [2022-11-02 20:18:19,586 INFO L899 garLoopResultBuilder]: For program point L1633(lines 1633 2793) no Hoare annotation was computed. [2022-11-02 20:18:19,586 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 117) no Hoare annotation was computed. [2022-11-02 20:18:19,586 INFO L899 garLoopResultBuilder]: For program point L2558(lines 2558 2651) no Hoare annotation was computed. [2022-11-02 20:18:19,586 INFO L899 garLoopResultBuilder]: For program point L510(lines 510 2966) no Hoare annotation was computed. [2022-11-02 20:18:19,586 INFO L899 garLoopResultBuilder]: For program point L246(lines 246 281) no Hoare annotation was computed. [2022-11-02 20:18:19,586 INFO L899 garLoopResultBuilder]: For program point L775(lines 775 2925) no Hoare annotation was computed. [2022-11-02 20:18:19,587 INFO L899 garLoopResultBuilder]: For program point L1766(lines 1766 2773) no Hoare annotation was computed. [2022-11-02 20:18:19,587 INFO L899 garLoopResultBuilder]: For program point L1700(lines 1700 2783) no Hoare annotation was computed. [2022-11-02 20:18:19,587 INFO L895 garLoopResultBuilder]: At program point L2625(lines 25 3002) 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-02 20:18:19,587 INFO L899 garLoopResultBuilder]: For program point L115(lines 115 123) no Hoare annotation was computed. [2022-11-02 20:18:19,587 INFO L899 garLoopResultBuilder]: For program point L2031(lines 2031 2732) no Hoare annotation was computed. [2022-11-02 20:18:19,588 INFO L899 garLoopResultBuilder]: For program point L908(lines 908 2905) no Hoare annotation was computed. [2022-11-02 20:18:19,588 INFO L899 garLoopResultBuilder]: For program point L842(lines 842 2915) no Hoare annotation was computed. [2022-11-02 20:18:19,588 INFO L899 garLoopResultBuilder]: For program point L2296(lines 2296 2691) no Hoare annotation was computed. [2022-11-02 20:18:19,588 INFO L899 garLoopResultBuilder]: For program point L1173(lines 1173 2864) no Hoare annotation was computed. [2022-11-02 20:18:19,588 INFO L899 garLoopResultBuilder]: For program point L1438(lines 1438 2823) no Hoare annotation was computed. [2022-11-02 20:18:19,588 INFO L899 garLoopResultBuilder]: For program point L2429(lines 2429 2671) no Hoare annotation was computed. [2022-11-02 20:18:19,588 INFO L899 garLoopResultBuilder]: For program point L315(lines 315 2996) no Hoare annotation was computed. [2022-11-02 20:18:19,588 INFO L899 garLoopResultBuilder]: For program point L2363(lines 2363 2681) no Hoare annotation was computed. [2022-11-02 20:18:19,589 INFO L899 garLoopResultBuilder]: For program point L183(lines 183 191) no Hoare annotation was computed. [2022-11-02 20:18:19,589 INFO L899 garLoopResultBuilder]: For program point L117(line 117) no Hoare annotation was computed. [2022-11-02 20:18:19,589 INFO L899 garLoopResultBuilder]: For program point L580(lines 580 2955) no Hoare annotation was computed. [2022-11-02 20:18:19,589 INFO L899 garLoopResultBuilder]: For program point L1571(lines 1571 2803) no Hoare annotation was computed. [2022-11-02 20:18:19,589 INFO L899 garLoopResultBuilder]: For program point L1505(lines 1505 2813) no Hoare annotation was computed. [2022-11-02 20:18:19,589 INFO L899 garLoopResultBuilder]: For program point L1836(lines 1836 2762) no Hoare annotation was computed. [2022-11-02 20:18:19,589 INFO L899 garLoopResultBuilder]: For program point L713(lines 713 2935) no Hoare annotation was computed. [2022-11-02 20:18:19,589 INFO L899 garLoopResultBuilder]: For program point L647(lines 647 2945) no Hoare annotation was computed. [2022-11-02 20:18:19,590 INFO L899 garLoopResultBuilder]: For program point L185(line 185) no Hoare annotation was computed. [2022-11-02 20:18:19,590 INFO L899 garLoopResultBuilder]: For program point L2101(lines 2101 2721) no Hoare annotation was computed. [2022-11-02 20:18:19,590 INFO L899 garLoopResultBuilder]: For program point L978(lines 978 2894) no Hoare annotation was computed. [2022-11-02 20:18:19,590 INFO L899 garLoopResultBuilder]: For program point L1243(lines 1243 2853) no Hoare annotation was computed. [2022-11-02 20:18:19,590 INFO L899 garLoopResultBuilder]: For program point L2234(lines 2234 2701) no Hoare annotation was computed. [2022-11-02 20:18:19,590 INFO L899 garLoopResultBuilder]: For program point L2168(lines 2168 2711) no Hoare annotation was computed. [2022-11-02 20:18:19,590 INFO L899 garLoopResultBuilder]: For program point L2631(lines 2631 2641) no Hoare annotation was computed. [2022-11-02 20:18:19,591 INFO L899 garLoopResultBuilder]: For program point L2499(lines 2499 2660) no Hoare annotation was computed. [2022-11-02 20:18:19,591 INFO L899 garLoopResultBuilder]: For program point L385(lines 385 2985) no Hoare annotation was computed. [2022-11-02 20:18:19,591 INFO L899 garLoopResultBuilder]: For program point L1376(lines 1376 2833) no Hoare annotation was computed. [2022-11-02 20:18:19,591 INFO L899 garLoopResultBuilder]: For program point L1310(lines 1310 2843) no Hoare annotation was computed. [2022-11-02 20:18:19,591 INFO L899 garLoopResultBuilder]: For program point L253(lines 253 275) no Hoare annotation was computed. [2022-11-02 20:18:19,591 INFO L899 garLoopResultBuilder]: For program point L1641(lines 1641 2792) no Hoare annotation was computed. [2022-11-02 20:18:19,591 INFO L899 garLoopResultBuilder]: For program point L518(lines 518 2965) no Hoare annotation was computed. [2022-11-02 20:18:19,591 INFO L899 garLoopResultBuilder]: For program point L452(lines 452 2975) no Hoare annotation was computed. [2022-11-02 20:18:19,592 INFO L899 garLoopResultBuilder]: For program point L1906(lines 1906 2751) no Hoare annotation was computed. [2022-11-02 20:18:19,592 INFO L899 garLoopResultBuilder]: For program point L783(lines 783 2924) no Hoare annotation was computed. [2022-11-02 20:18:19,592 INFO L899 garLoopResultBuilder]: For program point L255(line 255) no Hoare annotation was computed. [2022-11-02 20:18:19,592 INFO L899 garLoopResultBuilder]: For program point L1048(lines 1048 2883) no Hoare annotation was computed. [2022-11-02 20:18:19,592 INFO L899 garLoopResultBuilder]: For program point L2039(lines 2039 2731) no Hoare annotation was computed. [2022-11-02 20:18:19,592 INFO L899 garLoopResultBuilder]: For program point L1973(lines 1973 2741) no Hoare annotation was computed. [2022-11-02 20:18:19,594 INFO L895 garLoopResultBuilder]: At program point L2634(lines 64 3001) the Hoare annotation is: (let ((.cse0 (< |ULTIMATE.start_main_~main__t~0#1| |ULTIMATE.start_main_~main__tagbuf_len~0#1|))) (or (and (= |ULTIMATE.start_main_~main__t~0#1| 0) .cse0) (and (<= 1 |ULTIMATE.start_main_~main__t~0#1|) .cse0))) [2022-11-02 20:18:19,594 INFO L899 garLoopResultBuilder]: For program point L2304(lines 2304 2690) no Hoare annotation was computed. [2022-11-02 20:18:19,594 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-02 20:18:19,594 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 157) no Hoare annotation was computed. [2022-11-02 20:18:19,595 INFO L899 garLoopResultBuilder]: For program point L1181(lines 1181 2863) no Hoare annotation was computed. [2022-11-02 20:18:19,595 INFO L899 garLoopResultBuilder]: For program point L1115(lines 1115 2873) no Hoare annotation was computed. [2022-11-02 20:18:19,595 INFO L899 garLoopResultBuilder]: For program point L2569(lines 2569 2649) no Hoare annotation was computed. [2022-11-02 20:18:19,595 INFO L899 garLoopResultBuilder]: For program point L1446(lines 1446 2822) no Hoare annotation was computed. [2022-11-02 20:18:19,595 INFO L899 garLoopResultBuilder]: For program point L323(lines 323 2995) no Hoare annotation was computed. [2022-11-02 20:18:19,595 INFO L899 garLoopResultBuilder]: For program point L1711(lines 1711 2781) no Hoare annotation was computed. [2022-11-02 20:18:19,596 INFO L899 garLoopResultBuilder]: For program point L588(lines 588 2954) no Hoare annotation was computed. [2022-11-02 20:18:19,596 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 185) no Hoare annotation was computed. [2022-11-02 20:18:19,596 INFO L899 garLoopResultBuilder]: For program point L853(lines 853 2913) no Hoare annotation was computed. [2022-11-02 20:18:19,596 INFO L899 garLoopResultBuilder]: For program point L1844(lines 1844 2761) no Hoare annotation was computed. [2022-11-02 20:18:19,596 INFO L899 garLoopResultBuilder]: For program point L1778(lines 1778 2771) no Hoare annotation was computed. [2022-11-02 20:18:19,597 INFO L899 garLoopResultBuilder]: For program point L2109(lines 2109 2720) no Hoare annotation was computed. [2022-11-02 20:18:19,597 INFO L899 garLoopResultBuilder]: For program point L986(lines 986 2893) no Hoare annotation was computed. [2022-11-02 20:18:19,597 INFO L899 garLoopResultBuilder]: For program point L920(lines 920 2903) no Hoare annotation was computed. [2022-11-02 20:18:19,597 INFO L899 garLoopResultBuilder]: For program point L2374(lines 2374 2679) no Hoare annotation was computed. [2022-11-02 20:18:19,597 INFO L899 garLoopResultBuilder]: For program point L1251(lines 1251 2852) no Hoare annotation was computed. [2022-11-02 20:18:19,597 INFO L899 garLoopResultBuilder]: For program point L1516(lines 1516 2811) no Hoare annotation was computed. [2022-11-02 20:18:19,598 INFO L899 garLoopResultBuilder]: For program point L2507(lines 2507 2659) no Hoare annotation was computed. [2022-11-02 20:18:19,598 INFO L899 garLoopResultBuilder]: For program point L393(lines 393 2984) no Hoare annotation was computed. [2022-11-02 20:18:19,598 INFO L899 garLoopResultBuilder]: For program point L2441(lines 2441 2669) no Hoare annotation was computed. [2022-11-02 20:18:19,598 INFO L899 garLoopResultBuilder]: For program point L658(lines 658 2943) no Hoare annotation was computed. [2022-11-02 20:18:19,598 INFO L899 garLoopResultBuilder]: For program point L1649(lines 1649 2791) no Hoare annotation was computed. [2022-11-02 20:18:19,599 INFO L895 garLoopResultBuilder]: At program point L2640(lines 2591 2647) the Hoare annotation is: (and (< |ULTIMATE.start_main_~main__t~0#1| |ULTIMATE.start_main_~main__tagbuf_len~0#1|) (<= 59 |ULTIMATE.start_main_~main__t~0#1|)) [2022-11-02 20:18:19,599 INFO L899 garLoopResultBuilder]: For program point L1583(lines 1583 2801) no Hoare annotation was computed. [2022-11-02 20:18:19,599 INFO L899 garLoopResultBuilder]: For program point L64(lines 64 3001) no Hoare annotation was computed. [2022-11-02 20:18:19,599 INFO L899 garLoopResultBuilder]: For program point L1914(lines 1914 2750) no Hoare annotation was computed. [2022-11-02 20:18:19,599 INFO L899 garLoopResultBuilder]: For program point L791(lines 791 2923) no Hoare annotation was computed. [2022-11-02 20:18:19,599 INFO L899 garLoopResultBuilder]: For program point L725(lines 725 2933) no Hoare annotation was computed. [2022-11-02 20:18:19,600 INFO L899 garLoopResultBuilder]: For program point L2179(lines 2179 2709) no Hoare annotation was computed. [2022-11-02 20:18:19,600 INFO L899 garLoopResultBuilder]: For program point L1056(lines 1056 2882) no Hoare annotation was computed. [2022-11-02 20:18:19,600 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-02 20:18:19,600 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 35) no Hoare annotation was computed. [2022-11-02 20:18:19,600 INFO L899 garLoopResultBuilder]: For program point L1321(lines 1321 2841) no Hoare annotation was computed. [2022-11-02 20:18:19,600 INFO L899 garLoopResultBuilder]: For program point L2312(lines 2312 2689) no Hoare annotation was computed. [2022-11-02 20:18:19,601 INFO L899 garLoopResultBuilder]: For program point L2246(lines 2246 2699) no Hoare annotation was computed. [2022-11-02 20:18:19,601 INFO L899 garLoopResultBuilder]: For program point L132(lines 132 282) no Hoare annotation was computed. [2022-11-02 20:18:19,601 INFO L899 garLoopResultBuilder]: For program point L2577(lines 2577 2648) no Hoare annotation was computed. [2022-11-02 20:18:19,601 INFO L899 garLoopResultBuilder]: For program point L463(lines 463 2973) no Hoare annotation was computed. [2022-11-02 20:18:19,601 INFO L899 garLoopResultBuilder]: For program point L1454(lines 1454 2821) no Hoare annotation was computed. [2022-11-02 20:18:19,602 INFO L899 garLoopResultBuilder]: For program point L1388(lines 1388 2831) no Hoare annotation was computed. [2022-11-02 20:18:19,602 INFO L899 garLoopResultBuilder]: For program point L265(lines 265 273) no Hoare annotation was computed. [2022-11-02 20:18:19,602 INFO L899 garLoopResultBuilder]: For program point L1719(lines 1719 2780) no Hoare annotation was computed. [2022-11-02 20:18:19,602 INFO L899 garLoopResultBuilder]: For program point L596(lines 596 2953) no Hoare annotation was computed. [2022-11-02 20:18:19,602 INFO L899 garLoopResultBuilder]: For program point L530(lines 530 2963) no Hoare annotation was computed. [2022-11-02 20:18:19,602 INFO L899 garLoopResultBuilder]: For program point L1984(lines 1984 2739) no Hoare annotation was computed. [2022-11-02 20:18:19,603 INFO L899 garLoopResultBuilder]: For program point L861(lines 861 2912) no Hoare annotation was computed. [2022-11-02 20:18:19,603 INFO L899 garLoopResultBuilder]: For program point L267(line 267) no Hoare annotation was computed. [2022-11-02 20:18:19,603 INFO L899 garLoopResultBuilder]: For program point L1126(lines 1126 2871) no Hoare annotation was computed. [2022-11-02 20:18:19,603 INFO L899 garLoopResultBuilder]: For program point L2117(lines 2117 2719) no Hoare annotation was computed. [2022-11-02 20:18:19,603 INFO L899 garLoopResultBuilder]: For program point L2051(lines 2051 2729) no Hoare annotation was computed. [2022-11-02 20:18:19,603 INFO L899 garLoopResultBuilder]: For program point L2382(lines 2382 2678) no Hoare annotation was computed. [2022-11-02 20:18:19,604 INFO L899 garLoopResultBuilder]: For program point L1259(lines 1259 2851) no Hoare annotation was computed. [2022-11-02 20:18:19,604 INFO L899 garLoopResultBuilder]: For program point L1193(lines 1193 2861) no Hoare annotation was computed. [2022-11-02 20:18:19,604 INFO L899 garLoopResultBuilder]: For program point L136(lines 136 240) no Hoare annotation was computed. [2022-11-02 20:18:19,604 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 219) no Hoare annotation was computed. [2022-11-02 20:18:19,604 INFO L899 garLoopResultBuilder]: For program point L1524(lines 1524 2810) no Hoare annotation was computed. [2022-11-02 20:18:19,604 INFO L899 garLoopResultBuilder]: For program point L401(lines 401 2983) no Hoare annotation was computed. [2022-11-02 20:18:19,605 INFO L899 garLoopResultBuilder]: For program point L335(lines 335 2993) no Hoare annotation was computed. [2022-11-02 20:18:19,605 INFO L899 garLoopResultBuilder]: For program point L1789(lines 1789 2769) no Hoare annotation was computed. [2022-11-02 20:18:19,605 INFO L899 garLoopResultBuilder]: For program point L666(lines 666 2942) no Hoare annotation was computed. [2022-11-02 20:18:19,605 INFO L899 garLoopResultBuilder]: For program point L931(lines 931 2901) no Hoare annotation was computed. [2022-11-02 20:18:19,605 INFO L899 garLoopResultBuilder]: For program point L1922(lines 1922 2749) no Hoare annotation was computed. [2022-11-02 20:18:19,605 INFO L899 garLoopResultBuilder]: For program point L1856(lines 1856 2759) no Hoare annotation was computed. [2022-11-02 20:18:19,606 INFO L899 garLoopResultBuilder]: For program point L205(lines 205 229) no Hoare annotation was computed. [2022-11-02 20:18:19,606 INFO L899 garLoopResultBuilder]: For program point L2187(lines 2187 2708) no Hoare annotation was computed. [2022-11-02 20:18:19,606 INFO L899 garLoopResultBuilder]: For program point L1064(lines 1064 2881) no Hoare annotation was computed. [2022-11-02 20:18:19,606 INFO L899 garLoopResultBuilder]: For program point L998(lines 998 2891) no Hoare annotation was computed. [2022-11-02 20:18:19,606 INFO L899 garLoopResultBuilder]: For program point L2452(lines 2452 2667) no Hoare annotation was computed. [2022-11-02 20:18:19,606 INFO L899 garLoopResultBuilder]: For program point L1329(lines 1329 2840) no Hoare annotation was computed. [2022-11-02 20:18:19,607 INFO L899 garLoopResultBuilder]: For program point L74(lines 74 286) no Hoare annotation was computed. [2022-11-02 20:18:19,607 INFO L899 garLoopResultBuilder]: For program point L1594(lines 1594 2799) no Hoare annotation was computed. [2022-11-02 20:18:19,607 INFO L899 garLoopResultBuilder]: For program point L2585(lines 2585 2647) no Hoare annotation was computed. [2022-11-02 20:18:19,607 INFO L899 garLoopResultBuilder]: For program point L471(lines 471 2972) no Hoare annotation was computed. [2022-11-02 20:18:19,607 INFO L899 garLoopResultBuilder]: For program point L2519(lines 2519 2657) no Hoare annotation was computed. [2022-11-02 20:18:19,607 INFO L899 garLoopResultBuilder]: For program point L207(line 207) no Hoare annotation was computed. [2022-11-02 20:18:19,608 INFO L899 garLoopResultBuilder]: For program point L736(lines 736 2931) no Hoare annotation was computed. [2022-11-02 20:18:19,609 INFO L899 garLoopResultBuilder]: For program point L1727(lines 1727 2779) no Hoare annotation was computed. [2022-11-02 20:18:19,610 INFO L899 garLoopResultBuilder]: For program point L1661(lines 1661 2789) no Hoare annotation was computed. [2022-11-02 20:18:19,610 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 76) no Hoare annotation was computed. [2022-11-02 20:18:19,610 INFO L899 garLoopResultBuilder]: For program point L76(line 76) no Hoare annotation was computed. [2022-11-02 20:18:19,610 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 267) no Hoare annotation was computed. [2022-11-02 20:18:19,611 INFO L899 garLoopResultBuilder]: For program point L1992(lines 1992 2738) no Hoare annotation was computed. [2022-11-02 20:18:19,611 INFO L899 garLoopResultBuilder]: For program point L869(lines 869 2911) no Hoare annotation was computed. [2022-11-02 20:18:19,611 INFO L899 garLoopResultBuilder]: For program point L803(lines 803 2921) no Hoare annotation was computed. [2022-11-02 20:18:19,611 INFO L899 garLoopResultBuilder]: For program point L2257(lines 2257 2697) no Hoare annotation was computed. [2022-11-02 20:18:19,611 INFO L899 garLoopResultBuilder]: For program point L143(lines 143 234) no Hoare annotation was computed. [2022-11-02 20:18:19,611 INFO L899 garLoopResultBuilder]: For program point L1134(lines 1134 2870) no Hoare annotation was computed. [2022-11-02 20:18:19,612 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 105) no Hoare annotation was computed. [2022-11-02 20:18:19,612 INFO L899 garLoopResultBuilder]: For program point L1399(lines 1399 2829) no Hoare annotation was computed. [2022-11-02 20:18:19,612 INFO L899 garLoopResultBuilder]: For program point L2390(lines 2390 2677) no Hoare annotation was computed. [2022-11-02 20:18:19,612 INFO L899 garLoopResultBuilder]: For program point L2324(lines 2324 2687) no Hoare annotation was computed. [2022-11-02 20:18:19,612 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 2616) no Hoare annotation was computed. [2022-11-02 20:18:19,613 INFO L899 garLoopResultBuilder]: For program point L541(lines 541 2961) no Hoare annotation was computed. [2022-11-02 20:18:19,613 INFO L899 garLoopResultBuilder]: For program point L1532(lines 1532 2809) no Hoare annotation was computed. [2022-11-02 20:18:19,613 INFO L899 garLoopResultBuilder]: For program point L1466(lines 1466 2819) no Hoare annotation was computed. [2022-11-02 20:18:19,613 INFO L899 garLoopResultBuilder]: For program point L145(line 145) no Hoare annotation was computed. [2022-11-02 20:18:19,613 INFO L899 garLoopResultBuilder]: For program point L1797(lines 1797 2768) no Hoare annotation was computed. [2022-11-02 20:18:19,613 INFO L899 garLoopResultBuilder]: For program point L674(lines 674 2941) no Hoare annotation was computed. [2022-11-02 20:18:19,614 INFO L899 garLoopResultBuilder]: For program point L608(lines 608 2951) no Hoare annotation was computed. [2022-11-02 20:18:19,614 INFO L899 garLoopResultBuilder]: For program point L2062(lines 2062 2727) no Hoare annotation was computed. [2022-11-02 20:18:19,614 INFO L899 garLoopResultBuilder]: For program point L939(lines 939 2900) no Hoare annotation was computed. [2022-11-02 20:18:19,614 INFO L899 garLoopResultBuilder]: For program point L1204(lines 1204 2859) no Hoare annotation was computed. [2022-11-02 20:18:19,614 INFO L899 garLoopResultBuilder]: For program point L2195(lines 2195 2707) no Hoare annotation was computed. [2022-11-02 20:18:19,614 INFO L899 garLoopResultBuilder]: For program point L2129(lines 2129 2717) no Hoare annotation was computed. [2022-11-02 20:18:19,615 INFO L899 garLoopResultBuilder]: For program point L2460(lines 2460 2666) no Hoare annotation was computed. [2022-11-02 20:18:19,615 INFO L899 garLoopResultBuilder]: For program point L346(lines 346 2991) no Hoare annotation was computed. [2022-11-02 20:18:19,615 INFO L899 garLoopResultBuilder]: For program point L1337(lines 1337 2839) no Hoare annotation was computed. [2022-11-02 20:18:19,616 INFO L895 garLoopResultBuilder]: At program point L280(lines 132 282) the Hoare annotation is: (and (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~3#1| 0)) (<= 1 |ULTIMATE.start_main_~main__t~0#1|) (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~2#1| 0)) (not (<= |ULTIMATE.start_main_~main__tagbuf_len~0#1| |ULTIMATE.start_main_~main__t~0#1|))) [2022-11-02 20:18:19,616 INFO L899 garLoopResultBuilder]: For program point L1271(lines 1271 2849) no Hoare annotation was computed. [2022-11-02 20:18:19,616 INFO L899 garLoopResultBuilder]: For program point L1602(lines 1602 2798) no Hoare annotation was computed. [2022-11-02 20:18:19,616 INFO L899 garLoopResultBuilder]: For program point L479(lines 479 2971) no Hoare annotation was computed. [2022-11-02 20:18:19,617 INFO L899 garLoopResultBuilder]: For program point L413(lines 413 2981) no Hoare annotation was computed. [2022-11-02 20:18:19,617 INFO L899 garLoopResultBuilder]: For program point L1867(lines 1867 2757) no Hoare annotation was computed. [2022-11-02 20:18:19,617 INFO L899 garLoopResultBuilder]: For program point L744(lines 744 2930) no Hoare annotation was computed. [2022-11-02 20:18:19,617 INFO L899 garLoopResultBuilder]: For program point L1009(lines 1009 2889) no Hoare annotation was computed. [2022-11-02 20:18:19,617 INFO L899 garLoopResultBuilder]: For program point L2000(lines 2000 2737) no Hoare annotation was computed. [2022-11-02 20:18:19,617 INFO L899 garLoopResultBuilder]: For program point L1934(lines 1934 2747) no Hoare annotation was computed. [2022-11-02 20:18:19,618 INFO L899 garLoopResultBuilder]: For program point L217(lines 217 227) no Hoare annotation was computed. [2022-11-02 20:18:19,618 INFO L899 garLoopResultBuilder]: For program point L2265(lines 2265 2696) no Hoare annotation was computed. [2022-11-02 20:18:19,618 INFO L899 garLoopResultBuilder]: For program point L1142(lines 1142 2869) no Hoare annotation was computed. [2022-11-02 20:18:19,618 INFO L899 garLoopResultBuilder]: For program point L1076(lines 1076 2879) no Hoare annotation was computed. [2022-11-02 20:18:19,618 INFO L899 garLoopResultBuilder]: For program point L2530(lines 2530 2655) no Hoare annotation was computed. [2022-11-02 20:18:19,618 INFO L899 garLoopResultBuilder]: For program point L1407(lines 1407 2828) no Hoare annotation was computed. [2022-11-02 20:18:19,619 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-02 20:18:19,619 INFO L899 garLoopResultBuilder]: For program point L86(lines 86 284) no Hoare annotation was computed. [2022-11-02 20:18:19,619 INFO L899 garLoopResultBuilder]: For program point L1672(lines 1672 2787) no Hoare annotation was computed. [2022-11-02 20:18:19,619 INFO L899 garLoopResultBuilder]: For program point L549(lines 549 2960) no Hoare annotation was computed. [2022-11-02 20:18:19,619 INFO L899 garLoopResultBuilder]: For program point L219(line 219) no Hoare annotation was computed. [2022-11-02 20:18:19,619 INFO L899 garLoopResultBuilder]: For program point L21(lines 21 3007) no Hoare annotation was computed. [2022-11-02 20:18:19,620 INFO L899 garLoopResultBuilder]: For program point L814(lines 814 2919) no Hoare annotation was computed. [2022-11-02 20:18:19,620 INFO L899 garLoopResultBuilder]: For program point L1805(lines 1805 2767) no Hoare annotation was computed. [2022-11-02 20:18:19,620 INFO L899 garLoopResultBuilder]: For program point L1739(lines 1739 2777) no Hoare annotation was computed. [2022-11-02 20:18:19,620 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 145) no Hoare annotation was computed. [2022-11-02 20:18:19,620 INFO L899 garLoopResultBuilder]: For program point L88(line 88) no Hoare annotation was computed. [2022-11-02 20:18:19,621 INFO L899 garLoopResultBuilder]: For program point L2070(lines 2070 2726) no Hoare annotation was computed. [2022-11-02 20:18:19,621 INFO L899 garLoopResultBuilder]: For program point L947(lines 947 2899) no Hoare annotation was computed. [2022-11-02 20:18:19,621 INFO L899 garLoopResultBuilder]: For program point L881(lines 881 2909) no Hoare annotation was computed. [2022-11-02 20:18:19,621 INFO L899 garLoopResultBuilder]: For program point L2335(lines 2335 2685) no Hoare annotation was computed. [2022-11-02 20:18:19,621 INFO L899 garLoopResultBuilder]: For program point L1212(lines 1212 2858) no Hoare annotation was computed. [2022-11-02 20:18:19,622 INFO L899 garLoopResultBuilder]: For program point L155(lines 155 232) no Hoare annotation was computed. [2022-11-02 20:18:19,623 INFO L899 garLoopResultBuilder]: For program point L1477(lines 1477 2817) no Hoare annotation was computed. [2022-11-02 20:18:19,623 INFO L899 garLoopResultBuilder]: For program point L2468(lines 2468 2665) no Hoare annotation was computed. [2022-11-02 20:18:19,623 INFO L899 garLoopResultBuilder]: For program point L2402(lines 2402 2675) no Hoare annotation was computed. [2022-11-02 20:18:19,623 INFO L899 garLoopResultBuilder]: For program point L354(lines 354 2990) no Hoare annotation was computed. [2022-11-02 20:18:19,624 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 173) no Hoare annotation was computed. [2022-11-02 20:18:19,624 INFO L899 garLoopResultBuilder]: For program point L619(lines 619 2949) no Hoare annotation was computed. [2022-11-02 20:18:19,626 INFO L899 garLoopResultBuilder]: For program point L1610(lines 1610 2797) no Hoare annotation was computed. [2022-11-02 20:18:19,627 INFO L899 garLoopResultBuilder]: For program point L1544(lines 1544 2807) no Hoare annotation was computed. [2022-11-02 20:18:19,627 INFO L899 garLoopResultBuilder]: For program point L157(line 157) no Hoare annotation was computed. [2022-11-02 20:18:19,627 INFO L899 garLoopResultBuilder]: For program point L25(lines 25 3002) no Hoare annotation was computed. [2022-11-02 20:18:19,627 INFO L899 garLoopResultBuilder]: For program point L1875(lines 1875 2756) no Hoare annotation was computed. [2022-11-02 20:18:19,628 INFO L899 garLoopResultBuilder]: For program point L752(lines 752 2929) no Hoare annotation was computed. [2022-11-02 20:18:19,628 INFO L899 garLoopResultBuilder]: For program point L686(lines 686 2939) no Hoare annotation was computed. [2022-11-02 20:18:19,628 INFO L899 garLoopResultBuilder]: For program point L2602(lines 2602 2645) no Hoare annotation was computed. [2022-11-02 20:18:19,628 INFO L899 garLoopResultBuilder]: For program point L2140(lines 2140 2715) no Hoare annotation was computed. [2022-11-02 20:18:19,628 INFO L899 garLoopResultBuilder]: For program point L1017(lines 1017 2888) no Hoare annotation was computed. [2022-11-02 20:18:19,628 INFO L899 garLoopResultBuilder]: For program point L1282(lines 1282 2847) no Hoare annotation was computed. [2022-11-02 20:18:19,629 INFO L899 garLoopResultBuilder]: For program point L2273(lines 2273 2695) no Hoare annotation was computed. [2022-11-02 20:18:19,629 INFO L899 garLoopResultBuilder]: For program point L2207(lines 2207 2705) no Hoare annotation was computed. [2022-11-02 20:18:19,629 INFO L899 garLoopResultBuilder]: For program point L2604(line 2604) no Hoare annotation was computed. [2022-11-02 20:18:19,629 INFO L899 garLoopResultBuilder]: For program point L2538(lines 2538 2654) no Hoare annotation was computed. [2022-11-02 20:18:19,629 INFO L899 garLoopResultBuilder]: For program point L424(lines 424 2979) no Hoare annotation was computed. [2022-11-02 20:18:19,629 INFO L899 garLoopResultBuilder]: For program point L1415(lines 1415 2827) no Hoare annotation was computed. [2022-11-02 20:18:19,630 INFO L899 garLoopResultBuilder]: For program point L1349(lines 1349 2837) no Hoare annotation was computed. [2022-11-02 20:18:19,630 INFO L895 garLoopResultBuilder]: At program point L226(lines 92 284) the Hoare annotation is: (and (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~3#1| 0)) (<= 1 |ULTIMATE.start_main_~main__t~0#1|) (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~2#1| 0)) (<= |ULTIMATE.start_main_~main__t~0#1| |ULTIMATE.start_main_~main__tagbuf_len~0#1|)) [2022-11-02 20:18:19,630 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-02 20:18:19,630 INFO L899 garLoopResultBuilder]: For program point L1680(lines 1680 2786) no Hoare annotation was computed. [2022-11-02 20:18:19,630 INFO L899 garLoopResultBuilder]: For program point L557(lines 557 2959) no Hoare annotation was computed. [2022-11-02 20:18:19,631 INFO L899 garLoopResultBuilder]: For program point L491(lines 491 2969) no Hoare annotation was computed. [2022-11-02 20:18:19,631 INFO L899 garLoopResultBuilder]: For program point L1945(lines 1945 2745) no Hoare annotation was computed. [2022-11-02 20:18:19,631 INFO L899 garLoopResultBuilder]: For program point L822(lines 822 2918) no Hoare annotation was computed. [2022-11-02 20:18:19,631 INFO L899 garLoopResultBuilder]: For program point L1087(lines 1087 2877) no Hoare annotation was computed. [2022-11-02 20:18:19,631 INFO L899 garLoopResultBuilder]: For program point L2078(lines 2078 2725) no Hoare annotation was computed. [2022-11-02 20:18:19,631 INFO L899 garLoopResultBuilder]: For program point L2012(lines 2012 2735) no Hoare annotation was computed. [2022-11-02 20:18:19,632 INFO L899 garLoopResultBuilder]: For program point L2343(lines 2343 2684) no Hoare annotation was computed. [2022-11-02 20:18:19,632 INFO L899 garLoopResultBuilder]: For program point L1220(lines 1220 2857) no Hoare annotation was computed. [2022-11-02 20:18:19,632 INFO L899 garLoopResultBuilder]: For program point L1154(lines 1154 2867) no Hoare annotation was computed. [2022-11-02 20:18:19,632 INFO L899 garLoopResultBuilder]: For program point L1485(lines 1485 2816) no Hoare annotation was computed. [2022-11-02 20:18:19,632 INFO L899 garLoopResultBuilder]: For program point L362(lines 362 2989) no Hoare annotation was computed. [2022-11-02 20:18:19,632 INFO L899 garLoopResultBuilder]: For program point L296(lines 296 2999) no Hoare annotation was computed. [2022-11-02 20:18:19,633 INFO L899 garLoopResultBuilder]: For program point L164(lines 164 231) no Hoare annotation was computed. [2022-11-02 20:18:19,633 INFO L899 garLoopResultBuilder]: For program point L1750(lines 1750 2775) no Hoare annotation was computed. [2022-11-02 20:18:19,633 INFO L899 garLoopResultBuilder]: For program point L627(lines 627 2948) no Hoare annotation was computed. [2022-11-02 20:18:19,633 INFO L899 garLoopResultBuilder]: For program point L33(lines 33 57) no Hoare annotation was computed. [2022-11-02 20:18:19,633 INFO L902 garLoopResultBuilder]: At program point L3006(lines 21 3007) the Hoare annotation is: true [2022-11-02 20:18:19,633 INFO L899 garLoopResultBuilder]: For program point L892(lines 892 2907) no Hoare annotation was computed. [2022-11-02 20:18:19,634 INFO L899 garLoopResultBuilder]: For program point L1883(lines 1883 2755) no Hoare annotation was computed. [2022-11-02 20:18:19,634 INFO L899 garLoopResultBuilder]: For program point L1817(lines 1817 2765) no Hoare annotation was computed. [2022-11-02 20:18:19,634 INFO L899 garLoopResultBuilder]: For program point L2148(lines 2148 2714) no Hoare annotation was computed. [2022-11-02 20:18:19,634 INFO L899 garLoopResultBuilder]: For program point L1025(lines 1025 2887) no Hoare annotation was computed. [2022-11-02 20:18:19,634 INFO L899 garLoopResultBuilder]: For program point L959(lines 959 2897) no Hoare annotation was computed. [2022-11-02 20:18:19,635 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 207) no Hoare annotation was computed. [2022-11-02 20:18:19,635 INFO L899 garLoopResultBuilder]: For program point L2413(lines 2413 2673) no Hoare annotation was computed. [2022-11-02 20:18:19,635 INFO L899 garLoopResultBuilder]: For program point L1290(lines 1290 2846) no Hoare annotation was computed. [2022-11-02 20:18:19,635 INFO L899 garLoopResultBuilder]: For program point L35(line 35) no Hoare annotation was computed. [2022-11-02 20:18:19,640 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, 1, 1] [2022-11-02 20:18:19,645 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:18:19,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:18:19 BoogieIcfgContainer [2022-11-02 20:18:19,681 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:18:19,682 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:18:19,683 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:18:19,683 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:18:19,684 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:17:39" (3/4) ... [2022-11-02 20:18:19,687 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-02 20:18:19,728 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-11-02 20:18:19,731 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-02 20:18:19,733 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-02 20:18:19,736 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-02 20:18:19,975 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a14d9e4-8ca1-4127-ac1d-218729f0ab9f/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 20:18:19,976 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:18:19,976 INFO L158 Benchmark]: Toolchain (without parser) took 43731.50ms. Allocated memory was 111.1MB in the beginning and 771.8MB in the end (delta: 660.6MB). Free memory was 75.4MB in the beginning and 491.6MB in the end (delta: -416.2MB). Peak memory consumption was 243.1MB. Max. memory is 16.1GB. [2022-11-02 20:18:19,977 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 79.7MB. Free memory was 54.1MB in the beginning and 54.0MB in the end (delta: 28.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:18:19,977 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1235.75ms. Allocated memory is still 111.1MB. Free memory was 75.2MB in the beginning and 59.1MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-02 20:18:19,978 INFO L158 Benchmark]: Boogie Procedure Inliner took 162.78ms. Allocated memory is still 111.1MB. Free memory was 59.1MB in the beginning and 52.3MB in the end (delta: 6.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-02 20:18:19,978 INFO L158 Benchmark]: Boogie Preprocessor took 77.20ms. Allocated memory is still 111.1MB. Free memory was 51.8MB in the beginning and 47.1MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 20:18:19,979 INFO L158 Benchmark]: RCFGBuilder took 2225.04ms. Allocated memory was 111.1MB in the beginning and 148.9MB in the end (delta: 37.7MB). Free memory was 47.1MB in the beginning and 83.0MB in the end (delta: -35.9MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. [2022-11-02 20:18:19,980 INFO L158 Benchmark]: TraceAbstraction took 39723.27ms. Allocated memory was 148.9MB in the beginning and 771.8MB in the end (delta: 622.9MB). Free memory was 82.0MB in the beginning and 512.6MB in the end (delta: -430.5MB). Peak memory consumption was 435.8MB. Max. memory is 16.1GB. [2022-11-02 20:18:19,983 INFO L158 Benchmark]: Witness Printer took 293.61ms. Allocated memory is still 771.8MB. Free memory was 512.6MB in the beginning and 491.6MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-02 20:18:19,993 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.29ms. Allocated memory is still 79.7MB. Free memory was 54.1MB in the beginning and 54.0MB in the end (delta: 28.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1235.75ms. Allocated memory is still 111.1MB. Free memory was 75.2MB in the beginning and 59.1MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 162.78ms. Allocated memory is still 111.1MB. Free memory was 59.1MB in the beginning and 52.3MB in the end (delta: 6.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.20ms. Allocated memory is still 111.1MB. Free memory was 51.8MB in the beginning and 47.1MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 2225.04ms. Allocated memory was 111.1MB in the beginning and 148.9MB in the end (delta: 37.7MB). Free memory was 47.1MB in the beginning and 83.0MB in the end (delta: -35.9MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. * TraceAbstraction took 39723.27ms. Allocated memory was 148.9MB in the beginning and 771.8MB in the end (delta: 622.9MB). Free memory was 82.0MB in the beginning and 512.6MB in the end (delta: -430.5MB). Peak memory consumption was 435.8MB. Max. memory is 16.1GB. * Witness Printer took 293.61ms. Allocated memory is still 771.8MB. Free memory was 512.6MB in the beginning and 491.6MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. 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: 35]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 47]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 76]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 88]: 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: 255]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 267]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 2604]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 2616]: 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, 304 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 39.6s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 14.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5700 SdHoareTripleChecker+Valid, 13.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5700 mSDsluCounter, 9380 SdHoareTripleChecker+Invalid, 10.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5366 mSDsCounter, 1415 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12964 IncrementalHoareTripleChecker+Invalid, 14379 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1415 mSolverCounterUnsat, 4014 mSDtfsCounter, 12964 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 317 GetRequests, 161 SyntacticMatches, 1 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=304occurred in iteration=0, InterpolantAutomatonStates: 169, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 21 MinimizatonAttempts, 150 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 18 NumberOfFragments, 62 HoareAnnotationTreeSize, 7 FomulaSimplifications, 2025 FormulaSimplificationTreeSizeReduction, 1.6s HoareSimplificationTime, 7 FomulaSimplificationsInter, 14553 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 20.8s InterpolantComputationTime, 744 NumberOfCodeBlocks, 744 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 723 ConstructedInterpolants, 0 QuantifiedInterpolants, 2539 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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: 92]: Loop Invariant Derived loop invariant: ((!(__VERIFIER_assert__cond == 0) && 1 <= main__t) && !(__VERIFIER_assert__cond == 0)) && main__t <= main__tagbuf_len - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: ((!(__VERIFIER_assert__cond == 0) && 1 <= main__t) && !(__VERIFIER_assert__cond == 0)) && !(main__tagbuf_len <= main__t) - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 0 <= main__t && main__t <= main__tagbuf_len - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: (main__t == 0 && main__t < main__tagbuf_len) || (1 <= main__t && main__t < main__tagbuf_len) - InvariantResult [Line: 2591]: Loop Invariant Derived loop invariant: main__t < main__tagbuf_len && 59 <= main__t RESULT: Ultimate proved your program to be correct! [2022-11-02 20:18:20,080 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a14d9e4-8ca1-4127-ac1d-218729f0ab9f/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE