./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cac1803-fa3f-45d1-ab47-2f0f3fac6baf/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cac1803-fa3f-45d1-ab47-2f0f3fac6baf/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cac1803-fa3f-45d1-ab47-2f0f3fac6baf/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cac1803-fa3f-45d1-ab47-2f0f3fac6baf/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cac1803-fa3f-45d1-ab47-2f0f3fac6baf/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cac1803-fa3f-45d1-ab47-2f0f3fac6baf/bin/uautomizer-ZsLfNo2U6R --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 ce67d33baf8e2191d295422ec2c8649be746cd4f4f75c5de99bdc3950e33cc6c --- 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-38b53e6 [2022-11-25 18:24:16,661 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 18:24:16,663 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 18:24:16,689 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 18:24:16,690 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 18:24:16,692 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 18:24:16,694 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 18:24:16,696 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 18:24:16,699 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 18:24:16,700 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 18:24:16,702 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 18:24:16,704 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 18:24:16,704 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 18:24:16,706 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 18:24:16,708 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 18:24:16,710 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 18:24:16,711 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 18:24:16,713 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 18:24:16,715 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 18:24:16,718 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 18:24:16,720 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 18:24:16,722 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 18:24:16,724 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 18:24:16,726 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 18:24:16,731 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 18:24:16,732 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 18:24:16,732 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 18:24:16,734 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 18:24:16,735 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 18:24:16,736 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 18:24:16,737 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 18:24:16,738 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 18:24:16,739 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 18:24:16,740 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 18:24:16,742 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 18:24:16,742 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 18:24:16,744 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 18:24:16,744 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 18:24:16,745 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 18:24:16,746 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 18:24:16,747 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 18:24:16,749 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cac1803-fa3f-45d1-ab47-2f0f3fac6baf/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-25 18:24:16,777 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 18:24:16,778 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 18:24:16,778 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 18:24:16,778 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 18:24:16,779 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 18:24:16,780 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 18:24:16,781 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 18:24:16,781 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 18:24:16,781 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 18:24:16,782 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 18:24:16,782 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 18:24:16,782 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 18:24:16,783 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 18:24:16,783 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 18:24:16,783 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 18:24:16,784 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 18:24:16,784 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 18:24:16,784 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 18:24:16,785 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 18:24:16,785 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 18:24:16,786 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 18:24:16,786 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 18:24:16,786 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 18:24:16,787 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 18:24:16,787 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:24:16,787 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 18:24:16,788 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 18:24:16,788 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 18:24:16,788 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 18:24:16,789 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 18:24:16,789 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 18:24:16,789 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 18:24:16,789 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 18:24:16,790 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 18:24:16,790 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_9cac1803-fa3f-45d1-ab47-2f0f3fac6baf/bin/uautomizer-ZsLfNo2U6R/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_9cac1803-fa3f-45d1-ab47-2f0f3fac6baf/bin/uautomizer-ZsLfNo2U6R 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 -> ce67d33baf8e2191d295422ec2c8649be746cd4f4f75c5de99bdc3950e33cc6c [2022-11-25 18:24:17,102 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 18:24:17,146 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 18:24:17,150 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 18:24:17,152 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 18:24:17,153 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 18:24:17,154 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cac1803-fa3f-45d1-ab47-2f0f3fac6baf/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2022-11-25 18:24:20,562 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 18:24:20,853 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 18:24:20,854 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cac1803-fa3f-45d1-ab47-2f0f3fac6baf/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2022-11-25 18:24:20,863 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cac1803-fa3f-45d1-ab47-2f0f3fac6baf/bin/uautomizer-ZsLfNo2U6R/data/cbb46c06b/38fd6a65f1254b53b12810ad40ea2494/FLAG7bcaf914e [2022-11-25 18:24:20,880 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cac1803-fa3f-45d1-ab47-2f0f3fac6baf/bin/uautomizer-ZsLfNo2U6R/data/cbb46c06b/38fd6a65f1254b53b12810ad40ea2494 [2022-11-25 18:24:20,884 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 18:24:20,885 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 18:24:20,887 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 18:24:20,888 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 18:24:20,904 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 18:24:20,905 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:24:20" (1/1) ... [2022-11-25 18:24:20,907 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4069cd69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:24:20, skipping insertion in model container [2022-11-25 18:24:20,907 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:24:20" (1/1) ... [2022-11-25 18:24:20,917 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 18:24:20,950 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 18:24:21,148 WARN L237 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_9cac1803-fa3f-45d1-ab47-2f0f3fac6baf/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[1551,1564] [2022-11-25 18:24:21,155 WARN L237 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_9cac1803-fa3f-45d1-ab47-2f0f3fac6baf/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[1758,1771] [2022-11-25 18:24:21,158 WARN L237 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_9cac1803-fa3f-45d1-ab47-2f0f3fac6baf/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2095,2108] [2022-11-25 18:24:21,161 WARN L237 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_9cac1803-fa3f-45d1-ab47-2f0f3fac6baf/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2296,2309] [2022-11-25 18:24:21,164 WARN L237 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_9cac1803-fa3f-45d1-ab47-2f0f3fac6baf/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2701,2714] [2022-11-25 18:24:21,167 WARN L237 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_9cac1803-fa3f-45d1-ab47-2f0f3fac6baf/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2902,2915] [2022-11-25 18:24:21,170 WARN L237 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_9cac1803-fa3f-45d1-ab47-2f0f3fac6baf/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3228,3241] [2022-11-25 18:24:21,174 WARN L237 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_9cac1803-fa3f-45d1-ab47-2f0f3fac6baf/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3435,3448] [2022-11-25 18:24:21,179 WARN L237 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_9cac1803-fa3f-45d1-ab47-2f0f3fac6baf/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3914,3927] [2022-11-25 18:24:21,182 WARN L237 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_9cac1803-fa3f-45d1-ab47-2f0f3fac6baf/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4118,4131] [2022-11-25 18:24:21,185 WARN L237 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_9cac1803-fa3f-45d1-ab47-2f0f3fac6baf/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4426,4439] [2022-11-25 18:24:21,203 WARN L237 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_9cac1803-fa3f-45d1-ab47-2f0f3fac6baf/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4630,4643] [2022-11-25 18:24:21,206 WARN L237 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_9cac1803-fa3f-45d1-ab47-2f0f3fac6baf/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4995,5008] [2022-11-25 18:24:21,209 WARN L237 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_9cac1803-fa3f-45d1-ab47-2f0f3fac6baf/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5198,5211] [2022-11-25 18:24:21,212 WARN L237 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_9cac1803-fa3f-45d1-ab47-2f0f3fac6baf/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5412,5425] [2022-11-25 18:24:21,216 WARN L237 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_9cac1803-fa3f-45d1-ab47-2f0f3fac6baf/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5616,5629] [2022-11-25 18:24:21,221 WARN L237 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_9cac1803-fa3f-45d1-ab47-2f0f3fac6baf/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[6138,6151] [2022-11-25 18:24:21,224 WARN L237 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_9cac1803-fa3f-45d1-ab47-2f0f3fac6baf/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[6342,6355] [2022-11-25 18:24:21,227 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:24:21,242 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 18:24:21,263 WARN L237 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_9cac1803-fa3f-45d1-ab47-2f0f3fac6baf/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[1551,1564] [2022-11-25 18:24:21,265 WARN L237 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_9cac1803-fa3f-45d1-ab47-2f0f3fac6baf/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[1758,1771] [2022-11-25 18:24:21,267 WARN L237 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_9cac1803-fa3f-45d1-ab47-2f0f3fac6baf/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2095,2108] [2022-11-25 18:24:21,269 WARN L237 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_9cac1803-fa3f-45d1-ab47-2f0f3fac6baf/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2296,2309] [2022-11-25 18:24:21,272 WARN L237 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_9cac1803-fa3f-45d1-ab47-2f0f3fac6baf/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2701,2714] [2022-11-25 18:24:21,274 WARN L237 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_9cac1803-fa3f-45d1-ab47-2f0f3fac6baf/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2902,2915] [2022-11-25 18:24:21,277 WARN L237 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_9cac1803-fa3f-45d1-ab47-2f0f3fac6baf/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3228,3241] [2022-11-25 18:24:21,279 WARN L237 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_9cac1803-fa3f-45d1-ab47-2f0f3fac6baf/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3435,3448] [2022-11-25 18:24:21,283 WARN L237 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_9cac1803-fa3f-45d1-ab47-2f0f3fac6baf/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3914,3927] [2022-11-25 18:24:21,285 WARN L237 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_9cac1803-fa3f-45d1-ab47-2f0f3fac6baf/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4118,4131] [2022-11-25 18:24:21,288 WARN L237 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_9cac1803-fa3f-45d1-ab47-2f0f3fac6baf/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4426,4439] [2022-11-25 18:24:21,291 WARN L237 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_9cac1803-fa3f-45d1-ab47-2f0f3fac6baf/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4630,4643] [2022-11-25 18:24:21,294 WARN L237 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_9cac1803-fa3f-45d1-ab47-2f0f3fac6baf/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4995,5008] [2022-11-25 18:24:21,296 WARN L237 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_9cac1803-fa3f-45d1-ab47-2f0f3fac6baf/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5198,5211] [2022-11-25 18:24:21,299 WARN L237 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_9cac1803-fa3f-45d1-ab47-2f0f3fac6baf/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5412,5425] [2022-11-25 18:24:21,301 WARN L237 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_9cac1803-fa3f-45d1-ab47-2f0f3fac6baf/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5616,5629] [2022-11-25 18:24:21,305 WARN L237 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_9cac1803-fa3f-45d1-ab47-2f0f3fac6baf/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[6138,6151] [2022-11-25 18:24:21,307 WARN L237 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_9cac1803-fa3f-45d1-ab47-2f0f3fac6baf/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[6342,6355] [2022-11-25 18:24:21,310 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:24:21,327 INFO L208 MainTranslator]: Completed translation [2022-11-25 18:24:21,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:24:21 WrapperNode [2022-11-25 18:24:21,328 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 18:24:21,330 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 18:24:21,330 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 18:24:21,330 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 18:24:21,340 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:24:21" (1/1) ... [2022-11-25 18:24:21,350 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:24:21" (1/1) ... [2022-11-25 18:24:21,381 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 254 [2022-11-25 18:24:21,382 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 18:24:21,383 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 18:24:21,383 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 18:24:21,383 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 18:24:21,396 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:24:21" (1/1) ... [2022-11-25 18:24:21,396 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:24:21" (1/1) ... [2022-11-25 18:24:21,399 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:24:21" (1/1) ... [2022-11-25 18:24:21,399 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:24:21" (1/1) ... [2022-11-25 18:24:21,405 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:24:21" (1/1) ... [2022-11-25 18:24:21,409 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:24:21" (1/1) ... [2022-11-25 18:24:21,411 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:24:21" (1/1) ... [2022-11-25 18:24:21,413 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:24:21" (1/1) ... [2022-11-25 18:24:21,416 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 18:24:21,417 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 18:24:21,417 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 18:24:21,417 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 18:24:21,419 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:24:21" (1/1) ... [2022-11-25 18:24:21,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:24:21,443 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cac1803-fa3f-45d1-ab47-2f0f3fac6baf/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:24:21,460 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cac1803-fa3f-45d1-ab47-2f0f3fac6baf/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 18:24:21,516 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cac1803-fa3f-45d1-ab47-2f0f3fac6baf/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 18:24:21,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 18:24:21,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 18:24:21,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 18:24:21,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 18:24:21,686 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 18:24:21,689 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 18:24:22,066 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 18:24:22,074 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 18:24:22,075 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 18:24:22,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:24:22 BoogieIcfgContainer [2022-11-25 18:24:22,090 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 18:24:22,093 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 18:24:22,093 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 18:24:22,097 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 18:24:22,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 06:24:20" (1/3) ... [2022-11-25 18:24:22,111 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5835d4ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:24:22, skipping insertion in model container [2022-11-25 18:24:22,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:24:21" (2/3) ... [2022-11-25 18:24:22,112 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5835d4ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:24:22, skipping insertion in model container [2022-11-25 18:24:22,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:24:22" (3/3) ... [2022-11-25 18:24:22,114 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i.v+cfa-reducer.c [2022-11-25 18:24:22,155 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 18:24:22,156 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-11-25 18:24:22,242 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 18:24:22,252 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;@6c3dd8ac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 18:24:22,252 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2022-11-25 18:24:22,258 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 63 states have (on average 1.8888888888888888) internal successors, (119), 81 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:24:22,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-25 18:24:22,266 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:24:22,267 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:24:22,268 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-11-25 18:24:22,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:24:22,276 INFO L85 PathProgramCache]: Analyzing trace with hash -2034435078, now seen corresponding path program 1 times [2022-11-25 18:24:22,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:24:22,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024491273] [2022-11-25 18:24:22,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:24:22,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:24:22,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:22,635 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-25 18:24:22,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:24:22,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024491273] [2022-11-25 18:24:22,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024491273] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:24:22,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:24:22,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:24:22,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313732522] [2022-11-25 18:24:22,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:24:22,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:24:22,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:24:22,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:24:22,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:24:22,719 INFO L87 Difference]: Start difference. First operand has 82 states, 63 states have (on average 1.8888888888888888) internal successors, (119), 81 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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-25 18:24:22,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:24:22,760 INFO L93 Difference]: Finished difference Result 88 states and 123 transitions. [2022-11-25 18:24:22,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:24:22,763 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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-25 18:24:22,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:24:22,774 INFO L225 Difference]: With dead ends: 88 [2022-11-25 18:24:22,774 INFO L226 Difference]: Without dead ends: 76 [2022-11-25 18:24:22,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:24:22,782 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 75 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:24:22,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 124 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:24:22,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-25 18:24:22,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-11-25 18:24:22,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 59 states have (on average 1.3389830508474576) internal successors, (79), 75 states have internal predecessors, (79), 0 states have call successors, (0), 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-25 18:24:22,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2022-11-25 18:24:22,830 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 15 [2022-11-25 18:24:22,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:24:22,831 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2022-11-25 18:24:22,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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-25 18:24:22,832 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2022-11-25 18:24:22,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-25 18:24:22,832 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:24:22,832 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:24:22,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 18:24:22,833 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-11-25 18:24:22,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:24:22,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1357026114, now seen corresponding path program 1 times [2022-11-25 18:24:22,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:24:22,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690751207] [2022-11-25 18:24:22,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:24:22,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:24:22,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:23,060 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-25 18:24:23,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:24:23,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690751207] [2022-11-25 18:24:23,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690751207] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:24:23,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:24:23,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 18:24:23,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235650093] [2022-11-25 18:24:23,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:24:23,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:24:23,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:24:23,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:24:23,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:24:23,066 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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-25 18:24:23,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:24:23,200 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2022-11-25 18:24:23,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:24:23,201 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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-25 18:24:23,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:24:23,202 INFO L225 Difference]: With dead ends: 76 [2022-11-25 18:24:23,205 INFO L226 Difference]: Without dead ends: 74 [2022-11-25 18:24:23,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-25 18:24:23,207 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 252 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:24:23,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 80 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 18:24:23,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-11-25 18:24:23,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-11-25 18:24:23,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 58 states have (on average 1.3275862068965518) internal successors, (77), 73 states have internal predecessors, (77), 0 states have call successors, (0), 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-25 18:24:23,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2022-11-25 18:24:23,241 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 16 [2022-11-25 18:24:23,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:24:23,241 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2022-11-25 18:24:23,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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-25 18:24:23,242 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2022-11-25 18:24:23,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-25 18:24:23,243 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:24:23,243 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-25 18:24:23,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 18:24:23,244 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-11-25 18:24:23,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:24:23,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1567835227, now seen corresponding path program 1 times [2022-11-25 18:24:23,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:24:23,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109488876] [2022-11-25 18:24:23,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:24:23,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:24:23,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:23,411 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-25 18:24:23,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:24:23,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109488876] [2022-11-25 18:24:23,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109488876] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:24:23,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:24:23,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:24:23,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674503696] [2022-11-25 18:24:23,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:24:23,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:24:23,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:24:23,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:24:23,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:24:23,416 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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-25 18:24:23,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:24:23,563 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2022-11-25 18:24:23,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:24:23,564 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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-25 18:24:23,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:24:23,565 INFO L225 Difference]: With dead ends: 97 [2022-11-25 18:24:23,565 INFO L226 Difference]: Without dead ends: 95 [2022-11-25 18:24:23,566 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-25 18:24:23,567 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 112 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:24:23,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 120 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 18:24:23,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-11-25 18:24:23,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 72. [2022-11-25 18:24:23,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 57 states have (on average 1.3157894736842106) internal successors, (75), 71 states have internal predecessors, (75), 0 states have call successors, (0), 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-25 18:24:23,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2022-11-25 18:24:23,588 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 18 [2022-11-25 18:24:23,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:24:23,588 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2022-11-25 18:24:23,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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-25 18:24:23,589 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2022-11-25 18:24:23,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-25 18:24:23,590 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:24:23,590 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:24:23,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 18:24:23,591 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-11-25 18:24:23,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:24:23,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1358247672, now seen corresponding path program 1 times [2022-11-25 18:24:23,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:24:23,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338391427] [2022-11-25 18:24:23,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:24:23,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:24:23,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:23,819 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-25 18:24:23,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:24:23,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338391427] [2022-11-25 18:24:23,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338391427] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:24:23,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:24:23,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:24:23,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894539257] [2022-11-25 18:24:23,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:24:23,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:24:23,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:24:23,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:24:23,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:24:23,823 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 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-25 18:24:23,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:24:23,923 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2022-11-25 18:24:23,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:24:23,926 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2022-11-25 18:24:23,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:24:23,927 INFO L225 Difference]: With dead ends: 72 [2022-11-25 18:24:23,927 INFO L226 Difference]: Without dead ends: 70 [2022-11-25 18:24:23,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:24:23,929 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 170 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:24:23,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 77 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 18:24:23,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-25 18:24:23,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-11-25 18:24:23,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 69 states have internal predecessors, (73), 0 states have call successors, (0), 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-25 18:24:23,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2022-11-25 18:24:23,947 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 19 [2022-11-25 18:24:23,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:24:23,948 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2022-11-25 18:24:23,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 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-25 18:24:23,949 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-11-25 18:24:23,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-25 18:24:23,950 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:24:23,950 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] [2022-11-25 18:24:23,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 18:24:23,952 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-11-25 18:24:23,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:24:23,956 INFO L85 PathProgramCache]: Analyzing trace with hash -665385716, now seen corresponding path program 1 times [2022-11-25 18:24:23,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:24:23,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483602180] [2022-11-25 18:24:23,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:24:23,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:24:23,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:24,091 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-25 18:24:24,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:24:24,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483602180] [2022-11-25 18:24:24,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483602180] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:24:24,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:24:24,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:24:24,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021515585] [2022-11-25 18:24:24,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:24:24,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:24:24,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:24:24,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:24:24,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:24:24,096 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 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-25 18:24:24,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:24:24,338 INFO L93 Difference]: Finished difference Result 137 states and 143 transitions. [2022-11-25 18:24:24,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:24:24,339 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-11-25 18:24:24,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:24:24,344 INFO L225 Difference]: With dead ends: 137 [2022-11-25 18:24:24,345 INFO L226 Difference]: Without dead ends: 135 [2022-11-25 18:24:24,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-25 18:24:24,352 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 130 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:24:24,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 295 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 18:24:24,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-11-25 18:24:24,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 73. [2022-11-25 18:24:24,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 72 states have internal predecessors, (78), 0 states have call successors, (0), 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-25 18:24:24,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2022-11-25 18:24:24,383 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 22 [2022-11-25 18:24:24,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:24:24,383 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2022-11-25 18:24:24,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 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-25 18:24:24,384 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2022-11-25 18:24:24,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-25 18:24:24,385 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:24:24,386 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] [2022-11-25 18:24:24,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 18:24:24,386 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-11-25 18:24:24,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:24:24,390 INFO L85 PathProgramCache]: Analyzing trace with hash -661217951, now seen corresponding path program 1 times [2022-11-25 18:24:24,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:24:24,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261920093] [2022-11-25 18:24:24,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:24:24,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:24:24,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:24,486 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-25 18:24:24,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:24:24,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261920093] [2022-11-25 18:24:24,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261920093] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:24:24,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:24:24,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:24:24,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643313768] [2022-11-25 18:24:24,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:24:24,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:24:24,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:24:24,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:24:24,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:24:24,490 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 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-25 18:24:24,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:24:24,660 INFO L93 Difference]: Finished difference Result 104 states and 110 transitions. [2022-11-25 18:24:24,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:24:24,661 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-11-25 18:24:24,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:24:24,663 INFO L225 Difference]: With dead ends: 104 [2022-11-25 18:24:24,663 INFO L226 Difference]: Without dead ends: 102 [2022-11-25 18:24:24,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-25 18:24:24,668 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 119 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:24:24,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 171 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 18:24:24,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-11-25 18:24:24,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 75. [2022-11-25 18:24:24,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 61 states have (on average 1.3114754098360655) internal successors, (80), 74 states have internal predecessors, (80), 0 states have call successors, (0), 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-25 18:24:24,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2022-11-25 18:24:24,692 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 22 [2022-11-25 18:24:24,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:24:24,693 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2022-11-25 18:24:24,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 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-25 18:24:24,693 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2022-11-25 18:24:24,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-25 18:24:24,694 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:24:24,694 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] [2022-11-25 18:24:24,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 18:24:24,695 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-11-25 18:24:24,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:24:24,696 INFO L85 PathProgramCache]: Analyzing trace with hash 847883539, now seen corresponding path program 1 times [2022-11-25 18:24:24,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:24:24,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021586650] [2022-11-25 18:24:24,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:24:24,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:24:24,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:24,794 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-25 18:24:24,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:24:24,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021586650] [2022-11-25 18:24:24,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021586650] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:24:24,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:24:24,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:24:24,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478327016] [2022-11-25 18:24:24,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:24:24,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:24:24,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:24:24,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:24:24,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:24:24,798 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 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-25 18:24:24,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:24:24,927 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2022-11-25 18:24:24,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:24:24,928 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-11-25 18:24:24,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:24:24,929 INFO L225 Difference]: With dead ends: 117 [2022-11-25 18:24:24,930 INFO L226 Difference]: Without dead ends: 115 [2022-11-25 18:24:24,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:24:24,931 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 151 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:24:24,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 154 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 18:24:24,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-11-25 18:24:24,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 73. [2022-11-25 18:24:24,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 60 states have (on average 1.3) internal successors, (78), 72 states have internal predecessors, (78), 0 states have call successors, (0), 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-25 18:24:24,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2022-11-25 18:24:24,942 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 23 [2022-11-25 18:24:24,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:24:24,943 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2022-11-25 18:24:24,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 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-25 18:24:24,943 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2022-11-25 18:24:24,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-25 18:24:24,944 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:24:24,944 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] [2022-11-25 18:24:24,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 18:24:24,945 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-11-25 18:24:24,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:24:24,946 INFO L85 PathProgramCache]: Analyzing trace with hash 977084131, now seen corresponding path program 1 times [2022-11-25 18:24:24,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:24:24,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113868782] [2022-11-25 18:24:24,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:24:24,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:24:24,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:25,034 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-25 18:24:25,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:24:25,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113868782] [2022-11-25 18:24:25,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113868782] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:24:25,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:24:25,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:24:25,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729494067] [2022-11-25 18:24:25,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:24:25,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:24:25,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:24:25,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:24:25,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:24:25,038 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 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-25 18:24:25,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:24:25,131 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2022-11-25 18:24:25,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:24:25,132 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-11-25 18:24:25,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:24:25,133 INFO L225 Difference]: With dead ends: 73 [2022-11-25 18:24:25,133 INFO L226 Difference]: Without dead ends: 71 [2022-11-25 18:24:25,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:24:25,135 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 134 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:24:25,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 94 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:24:25,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-11-25 18:24:25,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-11-25 18:24:25,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 59 states have (on average 1.2881355932203389) internal successors, (76), 70 states have internal predecessors, (76), 0 states have call successors, (0), 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-25 18:24:25,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2022-11-25 18:24:25,144 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 23 [2022-11-25 18:24:25,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:24:25,145 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2022-11-25 18:24:25,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 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-25 18:24:25,145 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2022-11-25 18:24:25,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-25 18:24:25,146 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:24:25,146 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] [2022-11-25 18:24:25,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 18:24:25,147 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-11-25 18:24:25,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:24:25,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1619855478, now seen corresponding path program 1 times [2022-11-25 18:24:25,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:24:25,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995827944] [2022-11-25 18:24:25,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:24:25,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:24:25,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:25,190 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-25 18:24:25,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:24:25,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995827944] [2022-11-25 18:24:25,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995827944] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:24:25,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:24:25,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:24:25,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691954917] [2022-11-25 18:24:25,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:24:25,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:24:25,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:24:25,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:24:25,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:24:25,194 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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-25 18:24:25,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:24:25,246 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2022-11-25 18:24:25,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:24:25,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-11-25 18:24:25,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:24:25,248 INFO L225 Difference]: With dead ends: 111 [2022-11-25 18:24:25,248 INFO L226 Difference]: Without dead ends: 71 [2022-11-25 18:24:25,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:24:25,250 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:24:25,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:24:25,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-11-25 18:24:25,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-11-25 18:24:25,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 59 states have (on average 1.2542372881355932) internal successors, (74), 70 states have internal predecessors, (74), 0 states have call successors, (0), 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-25 18:24:25,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2022-11-25 18:24:25,260 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 25 [2022-11-25 18:24:25,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:24:25,261 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2022-11-25 18:24:25,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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-25 18:24:25,261 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2022-11-25 18:24:25,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-25 18:24:25,262 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:24:25,263 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:24:25,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 18:24:25,263 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-11-25 18:24:25,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:24:25,264 INFO L85 PathProgramCache]: Analyzing trace with hash 595608307, now seen corresponding path program 1 times [2022-11-25 18:24:25,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:24:25,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434922737] [2022-11-25 18:24:25,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:24:25,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:24:25,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:25,403 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 18:24:25,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:24:25,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434922737] [2022-11-25 18:24:25,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434922737] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:24:25,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959353066] [2022-11-25 18:24:25,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:24:25,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:24:25,406 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cac1803-fa3f-45d1-ab47-2f0f3fac6baf/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:24:25,410 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cac1803-fa3f-45d1-ab47-2f0f3fac6baf/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:24:25,424 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cac1803-fa3f-45d1-ab47-2f0f3fac6baf/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 18:24:25,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:25,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-25 18:24:25,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:24:25,650 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 18:24:25,651 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:24:25,725 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 18:24:25,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [959353066] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:24:25,727 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:24:25,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2022-11-25 18:24:25,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186001830] [2022-11-25 18:24:25,728 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:24:25,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:24:25,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:24:25,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:24:25,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:24:25,731 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 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-25 18:24:25,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:24:25,855 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2022-11-25 18:24:25,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:24:25,856 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 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 26 [2022-11-25 18:24:25,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:24:25,859 INFO L225 Difference]: With dead ends: 111 [2022-11-25 18:24:25,859 INFO L226 Difference]: Without dead ends: 109 [2022-11-25 18:24:25,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 47 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-25 18:24:25,861 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 90 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:24:25,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 179 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 18:24:25,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-11-25 18:24:25,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 68. [2022-11-25 18:24:25,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 57 states have (on average 1.2456140350877194) internal successors, (71), 67 states have internal predecessors, (71), 0 states have call successors, (0), 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-25 18:24:25,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2022-11-25 18:24:25,871 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 26 [2022-11-25 18:24:25,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:24:25,874 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2022-11-25 18:24:25,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 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-25 18:24:25,875 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2022-11-25 18:24:25,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-25 18:24:25,876 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:24:25,876 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] [2022-11-25 18:24:25,889 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cac1803-fa3f-45d1-ab47-2f0f3fac6baf/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 18:24:26,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cac1803-fa3f-45d1-ab47-2f0f3fac6baf/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-25 18:24:26,084 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-11-25 18:24:26,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:24:26,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1780382557, now seen corresponding path program 1 times [2022-11-25 18:24:26,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:24:26,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463858961] [2022-11-25 18:24:26,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:24:26,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:24:26,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:26,253 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-25 18:24:26,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:24:26,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463858961] [2022-11-25 18:24:26,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463858961] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:24:26,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:24:26,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:24:26,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125349378] [2022-11-25 18:24:26,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:24:26,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:24:26,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:24:26,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:24:26,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:24:26,259 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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-25 18:24:26,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:24:26,340 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2022-11-25 18:24:26,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:24:26,340 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2022-11-25 18:24:26,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:24:26,341 INFO L225 Difference]: With dead ends: 69 [2022-11-25 18:24:26,342 INFO L226 Difference]: Without dead ends: 67 [2022-11-25 18:24:26,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:24:26,344 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 113 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:24:26,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 72 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:24:26,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-11-25 18:24:26,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2022-11-25 18:24:26,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 65 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:24:26,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2022-11-25 18:24:26,353 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 26 [2022-11-25 18:24:26,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:24:26,354 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2022-11-25 18:24:26,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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-25 18:24:26,354 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2022-11-25 18:24:26,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-25 18:24:26,357 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:24:26,358 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:24:26,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 18:24:26,358 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-11-25 18:24:26,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:24:26,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1280139623, now seen corresponding path program 1 times [2022-11-25 18:24:26,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:24:26,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348186598] [2022-11-25 18:24:26,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:24:26,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:24:26,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:26,530 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 18:24:26,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:24:26,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348186598] [2022-11-25 18:24:26,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348186598] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:24:26,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820222933] [2022-11-25 18:24:26,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:24:26,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:24:26,531 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cac1803-fa3f-45d1-ab47-2f0f3fac6baf/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:24:26,533 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cac1803-fa3f-45d1-ab47-2f0f3fac6baf/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:24:26,550 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cac1803-fa3f-45d1-ab47-2f0f3fac6baf/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 18:24:26,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:26,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-25 18:24:26,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:24:26,713 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 18:24:26,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:24:26,782 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 18:24:26,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [820222933] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:24:26,782 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:24:26,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2022-11-25 18:24:26,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069253867] [2022-11-25 18:24:26,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:24:26,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:24:26,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:24:26,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:24:26,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:24:26,785 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:24:26,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:24:26,854 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2022-11-25 18:24:26,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:24:26,855 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-25 18:24:26,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:24:26,857 INFO L225 Difference]: With dead ends: 67 [2022-11-25 18:24:26,857 INFO L226 Difference]: Without dead ends: 65 [2022-11-25 18:24:26,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-25 18:24:26,858 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 154 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:24:26,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 67 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:24:26,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-25 18:24:26,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2022-11-25 18:24:26,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 59 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:24:26,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2022-11-25 18:24:26,868 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 27 [2022-11-25 18:24:26,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:24:26,868 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2022-11-25 18:24:26,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:24:26,869 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-11-25 18:24:26,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-25 18:24:26,872 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:24:26,872 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] [2022-11-25 18:24:26,878 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cac1803-fa3f-45d1-ab47-2f0f3fac6baf/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-25 18:24:27,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cac1803-fa3f-45d1-ab47-2f0f3fac6baf/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:24:27,079 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-11-25 18:24:27,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:24:27,079 INFO L85 PathProgramCache]: Analyzing trace with hash -642711428, now seen corresponding path program 1 times [2022-11-25 18:24:27,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:24:27,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162191927] [2022-11-25 18:24:27,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:24:27,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:24:27,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:27,212 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-25 18:24:27,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:24:27,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162191927] [2022-11-25 18:24:27,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162191927] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:24:27,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:24:27,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:24:27,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188129252] [2022-11-25 18:24:27,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:24:27,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:24:27,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:24:27,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:24:27,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:24:27,217 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 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-25 18:24:27,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:24:27,287 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2022-11-25 18:24:27,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:24:27,288 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-11-25 18:24:27,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:24:27,290 INFO L225 Difference]: With dead ends: 60 [2022-11-25 18:24:27,290 INFO L226 Difference]: Without dead ends: 58 [2022-11-25 18:24:27,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:24:27,292 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 112 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:24:27,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 68 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:24:27,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-11-25 18:24:27,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-11-25 18:24:27,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 50 states have (on average 1.2) internal successors, (60), 57 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:24:27,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2022-11-25 18:24:27,300 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 27 [2022-11-25 18:24:27,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:24:27,301 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2022-11-25 18:24:27,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 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-25 18:24:27,302 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2022-11-25 18:24:27,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-25 18:24:27,306 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:24:27,307 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] [2022-11-25 18:24:27,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 18:24:27,307 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-11-25 18:24:27,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:24:27,308 INFO L85 PathProgramCache]: Analyzing trace with hash -47880409, now seen corresponding path program 1 times [2022-11-25 18:24:27,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:24:27,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723885108] [2022-11-25 18:24:27,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:24:27,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:24:27,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:27,461 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-25 18:24:27,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:24:27,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723885108] [2022-11-25 18:24:27,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723885108] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:24:27,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:24:27,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:24:27,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949703419] [2022-11-25 18:24:27,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:24:27,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:24:27,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:24:27,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:24:27,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:24:27,466 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:24:27,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:24:27,534 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2022-11-25 18:24:27,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:24:27,535 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-25 18:24:27,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:24:27,535 INFO L225 Difference]: With dead ends: 59 [2022-11-25 18:24:27,535 INFO L226 Difference]: Without dead ends: 57 [2022-11-25 18:24:27,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:24:27,536 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 57 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:24:27,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 73 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:24:27,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-11-25 18:24:27,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2022-11-25 18:24:27,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 49 states have (on average 1.183673469387755) internal successors, (58), 55 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:24:27,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2022-11-25 18:24:27,544 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 30 [2022-11-25 18:24:27,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:24:27,544 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2022-11-25 18:24:27,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:24:27,544 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2022-11-25 18:24:27,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-25 18:24:27,546 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:24:27,546 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] [2022-11-25 18:24:27,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 18:24:27,547 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-11-25 18:24:27,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:24:27,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1484288504, now seen corresponding path program 1 times [2022-11-25 18:24:27,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:24:27,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067413256] [2022-11-25 18:24:27,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:24:27,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:24:27,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:27,677 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-25 18:24:27,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:24:27,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067413256] [2022-11-25 18:24:27,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067413256] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:24:27,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:24:27,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 18:24:27,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500664048] [2022-11-25 18:24:27,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:24:27,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:24:27,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:24:27,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:24:27,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:24:27,680 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 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-25 18:24:27,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:24:27,788 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2022-11-25 18:24:27,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:24:27,789 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2022-11-25 18:24:27,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:24:27,790 INFO L225 Difference]: With dead ends: 67 [2022-11-25 18:24:27,790 INFO L226 Difference]: Without dead ends: 65 [2022-11-25 18:24:27,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-25 18:24:27,793 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 127 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:24:27,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 76 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 18:24:27,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-25 18:24:27,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 54. [2022-11-25 18:24:27,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 53 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:24:27,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2022-11-25 18:24:27,802 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 31 [2022-11-25 18:24:27,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:24:27,803 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2022-11-25 18:24:27,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 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-25 18:24:27,803 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2022-11-25 18:24:27,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-25 18:24:27,805 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:24:27,805 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] [2022-11-25 18:24:27,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 18:24:27,806 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-11-25 18:24:27,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:24:27,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1746453711, now seen corresponding path program 1 times [2022-11-25 18:24:27,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:24:27,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043167163] [2022-11-25 18:24:27,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:24:27,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:24:27,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:27,931 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-25 18:24:27,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:24:27,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043167163] [2022-11-25 18:24:27,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043167163] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:24:27,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:24:27,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:24:27,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204727385] [2022-11-25 18:24:27,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:24:27,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:24:27,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:24:27,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:24:27,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:24:27,935 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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-25 18:24:28,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:24:28,084 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2022-11-25 18:24:28,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:24:28,085 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2022-11-25 18:24:28,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:24:28,086 INFO L225 Difference]: With dead ends: 87 [2022-11-25 18:24:28,086 INFO L226 Difference]: Without dead ends: 85 [2022-11-25 18:24:28,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:24:28,087 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 94 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:24:28,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 117 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 18:24:28,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-11-25 18:24:28,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 57. [2022-11-25 18:24:28,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 56 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:24:28,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2022-11-25 18:24:28,097 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 34 [2022-11-25 18:24:28,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:24:28,098 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2022-11-25 18:24:28,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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-25 18:24:28,098 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2022-11-25 18:24:28,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-25 18:24:28,099 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:24:28,099 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] [2022-11-25 18:24:28,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-25 18:24:28,099 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-11-25 18:24:28,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:24:28,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1694514003, now seen corresponding path program 1 times [2022-11-25 18:24:28,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:24:28,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754977431] [2022-11-25 18:24:28,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:24:28,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:24:28,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:28,192 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-25 18:24:28,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:24:28,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754977431] [2022-11-25 18:24:28,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754977431] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:24:28,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:24:28,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:24:28,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013920950] [2022-11-25 18:24:28,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:24:28,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:24:28,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:24:28,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:24:28,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:24:28,195 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 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-25 18:24:28,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:24:28,304 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2022-11-25 18:24:28,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:24:28,305 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2022-11-25 18:24:28,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:24:28,306 INFO L225 Difference]: With dead ends: 57 [2022-11-25 18:24:28,306 INFO L226 Difference]: Without dead ends: 55 [2022-11-25 18:24:28,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:24:28,307 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 59 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:24:28,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 109 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 18:24:28,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-25 18:24:28,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-11-25 18:24:28,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.14) internal successors, (57), 54 states have internal predecessors, (57), 0 states have call successors, (0), 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-25 18:24:28,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2022-11-25 18:24:28,316 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 35 [2022-11-25 18:24:28,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:24:28,316 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2022-11-25 18:24:28,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 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-25 18:24:28,317 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2022-11-25 18:24:28,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-25 18:24:28,317 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:24:28,317 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] [2022-11-25 18:24:28,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-25 18:24:28,318 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-11-25 18:24:28,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:24:28,319 INFO L85 PathProgramCache]: Analyzing trace with hash 635482230, now seen corresponding path program 1 times [2022-11-25 18:24:28,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:24:28,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849624352] [2022-11-25 18:24:28,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:24:28,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:24:28,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:28,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:24:28,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:24:28,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849624352] [2022-11-25 18:24:28,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849624352] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:24:28,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:24:28,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:24:28,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111291750] [2022-11-25 18:24:28,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:24:28,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:24:28,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:24:28,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:24:28,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:24:28,404 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 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-25 18:24:28,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:24:28,445 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2022-11-25 18:24:28,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:24:28,446 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2022-11-25 18:24:28,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:24:28,446 INFO L225 Difference]: With dead ends: 66 [2022-11-25 18:24:28,447 INFO L226 Difference]: Without dead ends: 64 [2022-11-25 18:24:28,447 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-25 18:24:28,448 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 23 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:24:28,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 142 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:24:28,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-11-25 18:24:28,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 53. [2022-11-25 18:24:28,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 52 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:24:28,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2022-11-25 18:24:28,457 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 37 [2022-11-25 18:24:28,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:24:28,457 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2022-11-25 18:24:28,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 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-25 18:24:28,457 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2022-11-25 18:24:28,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-25 18:24:28,458 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:24:28,458 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] [2022-11-25 18:24:28,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-25 18:24:28,459 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-11-25 18:24:28,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:24:28,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1774883137, now seen corresponding path program 1 times [2022-11-25 18:24:28,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:24:28,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632571226] [2022-11-25 18:24:28,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:24:28,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:24:28,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:28,550 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-25 18:24:28,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:24:28,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632571226] [2022-11-25 18:24:28,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632571226] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:24:28,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:24:28,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:24:28,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103718709] [2022-11-25 18:24:28,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:24:28,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:24:28,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:24:28,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:24:28,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:24:28,554 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:24:28,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:24:28,594 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2022-11-25 18:24:28,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:24:28,595 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-11-25 18:24:28,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:24:28,596 INFO L225 Difference]: With dead ends: 62 [2022-11-25 18:24:28,596 INFO L226 Difference]: Without dead ends: 60 [2022-11-25 18:24:28,596 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-25 18:24:28,597 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 36 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:24:28,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 172 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:24:28,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-11-25 18:24:28,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 51. [2022-11-25 18:24:28,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 48 states have (on average 1.1041666666666667) internal successors, (53), 50 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:24:28,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2022-11-25 18:24:28,610 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 38 [2022-11-25 18:24:28,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:24:28,610 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2022-11-25 18:24:28,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:24:28,611 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2022-11-25 18:24:28,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-25 18:24:28,611 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:24:28,611 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] [2022-11-25 18:24:28,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-25 18:24:28,612 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-11-25 18:24:28,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:24:28,613 INFO L85 PathProgramCache]: Analyzing trace with hash 813201821, now seen corresponding path program 1 times [2022-11-25 18:24:28,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:24:28,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381744527] [2022-11-25 18:24:28,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:24:28,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:24:28,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:28,746 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-25 18:24:28,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:24:28,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381744527] [2022-11-25 18:24:28,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381744527] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:24:28,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:24:28,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:24:28,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479696935] [2022-11-25 18:24:28,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:24:28,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:24:28,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:24:28,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:24:28,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:24:28,750 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 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-25 18:24:28,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:24:28,917 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2022-11-25 18:24:28,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:24:28,918 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2022-11-25 18:24:28,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:24:28,919 INFO L225 Difference]: With dead ends: 84 [2022-11-25 18:24:28,919 INFO L226 Difference]: Without dead ends: 82 [2022-11-25 18:24:28,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:24:28,920 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 53 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:24:28,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 125 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 18:24:28,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-25 18:24:28,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 56. [2022-11-25 18:24:28,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 53 states have (on average 1.1132075471698113) internal successors, (59), 55 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:24:28,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2022-11-25 18:24:28,930 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 39 [2022-11-25 18:24:28,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:24:28,930 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2022-11-25 18:24:28,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 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-25 18:24:28,931 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2022-11-25 18:24:28,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-25 18:24:28,931 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:24:28,931 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] [2022-11-25 18:24:28,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-25 18:24:28,932 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-11-25 18:24:28,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:24:28,932 INFO L85 PathProgramCache]: Analyzing trace with hash -560543098, now seen corresponding path program 1 times [2022-11-25 18:24:28,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:24:28,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373040427] [2022-11-25 18:24:28,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:24:28,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:24:28,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:29,024 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-25 18:24:29,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:24:29,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373040427] [2022-11-25 18:24:29,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373040427] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:24:29,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:24:29,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:24:29,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627359527] [2022-11-25 18:24:29,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:24:29,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:24:29,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:24:29,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:24:29,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:24:29,027 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 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-25 18:24:29,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:24:29,135 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2022-11-25 18:24:29,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:24:29,136 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2022-11-25 18:24:29,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:24:29,137 INFO L225 Difference]: With dead ends: 69 [2022-11-25 18:24:29,137 INFO L226 Difference]: Without dead ends: 67 [2022-11-25 18:24:29,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:24:29,138 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 36 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:24:29,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 119 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 18:24:29,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-11-25 18:24:29,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 54. [2022-11-25 18:24:29,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 52 states have (on average 1.0961538461538463) internal successors, (57), 53 states have internal predecessors, (57), 0 states have call successors, (0), 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-25 18:24:29,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2022-11-25 18:24:29,148 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 40 [2022-11-25 18:24:29,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:24:29,149 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2022-11-25 18:24:29,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 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-25 18:24:29,149 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-11-25 18:24:29,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-25 18:24:29,150 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:24:29,150 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:24:29,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-25 18:24:29,151 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-11-25 18:24:29,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:24:29,151 INFO L85 PathProgramCache]: Analyzing trace with hash 375780089, now seen corresponding path program 1 times [2022-11-25 18:24:29,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:24:29,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411742902] [2022-11-25 18:24:29,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:24:29,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:24:29,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:29,307 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:24:29,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:24:29,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411742902] [2022-11-25 18:24:29,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411742902] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:24:29,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1857989620] [2022-11-25 18:24:29,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:24:29,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:24:29,309 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cac1803-fa3f-45d1-ab47-2f0f3fac6baf/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:24:29,310 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cac1803-fa3f-45d1-ab47-2f0f3fac6baf/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:24:29,338 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cac1803-fa3f-45d1-ab47-2f0f3fac6baf/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 18:24:29,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:29,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-25 18:24:29,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:24:29,509 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:24:29,509 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:24:29,584 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:24:29,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1857989620] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:24:29,585 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:24:29,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2022-11-25 18:24:29,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870319438] [2022-11-25 18:24:29,585 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:24:29,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:24:29,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:24:29,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:24:29,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:24:29,587 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:24:29,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:24:29,670 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2022-11-25 18:24:29,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:24:29,671 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-11-25 18:24:29,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:24:29,671 INFO L225 Difference]: With dead ends: 54 [2022-11-25 18:24:29,671 INFO L226 Difference]: Without dead ends: 52 [2022-11-25 18:24:29,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 73 SyntacticMatches, 8 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-25 18:24:29,674 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 42 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:24:29,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 54 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 18:24:29,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-11-25 18:24:29,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-11-25 18:24:29,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 51 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:24:29,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2022-11-25 18:24:29,684 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 40 [2022-11-25 18:24:29,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:24:29,684 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2022-11-25 18:24:29,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:24:29,685 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2022-11-25 18:24:29,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-25 18:24:29,685 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:24:29,686 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:24:29,698 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cac1803-fa3f-45d1-ab47-2f0f3fac6baf/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 18:24:29,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cac1803-fa3f-45d1-ab47-2f0f3fac6baf/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:24:29,893 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-11-25 18:24:29,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:24:29,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1394778411, now seen corresponding path program 1 times [2022-11-25 18:24:29,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:24:29,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835872707] [2022-11-25 18:24:29,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:24:29,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:24:29,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:30,012 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 18:24:30,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:24:30,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835872707] [2022-11-25 18:24:30,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835872707] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:24:30,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:24:30,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:24:30,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446299139] [2022-11-25 18:24:30,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:24:30,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:24:30,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:24:30,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:24:30,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:24:30,015 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:24:30,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:24:30,175 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2022-11-25 18:24:30,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:24:30,176 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-11-25 18:24:30,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:24:30,176 INFO L225 Difference]: With dead ends: 71 [2022-11-25 18:24:30,176 INFO L226 Difference]: Without dead ends: 0 [2022-11-25 18:24:30,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 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-25 18:24:30,178 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 37 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:24:30,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 86 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 18:24:30,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-25 18:24:30,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-25 18:24:30,179 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-25 18:24:30,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-25 18:24:30,180 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2022-11-25 18:24:30,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:24:30,180 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-25 18:24:30,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:24:30,180 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-25 18:24:30,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-25 18:24:30,184 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (17 of 18 remaining) [2022-11-25 18:24:30,184 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (16 of 18 remaining) [2022-11-25 18:24:30,185 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (15 of 18 remaining) [2022-11-25 18:24:30,185 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (14 of 18 remaining) [2022-11-25 18:24:30,185 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (13 of 18 remaining) [2022-11-25 18:24:30,185 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (12 of 18 remaining) [2022-11-25 18:24:30,186 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (11 of 18 remaining) [2022-11-25 18:24:30,186 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (10 of 18 remaining) [2022-11-25 18:24:30,186 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (9 of 18 remaining) [2022-11-25 18:24:30,186 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (8 of 18 remaining) [2022-11-25 18:24:30,187 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (7 of 18 remaining) [2022-11-25 18:24:30,187 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (6 of 18 remaining) [2022-11-25 18:24:30,187 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (5 of 18 remaining) [2022-11-25 18:24:30,187 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (4 of 18 remaining) [2022-11-25 18:24:30,187 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (3 of 18 remaining) [2022-11-25 18:24:30,188 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (2 of 18 remaining) [2022-11-25 18:24:30,188 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION (1 of 18 remaining) [2022-11-25 18:24:30,188 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION (0 of 18 remaining) [2022-11-25 18:24:30,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-25 18:24:30,191 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-25 18:24:48,653 WARN L233 SmtUtils]: Spent 18.46s on a formula simplification. DAG size of input: 120 DAG size of output: 115 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-25 18:24:53,616 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 97) no Hoare annotation was computed. [2022-11-25 18:24:53,616 INFO L899 garLoopResultBuilder]: For program point L85(line 85) no Hoare annotation was computed. [2022-11-25 18:24:53,616 INFO L899 garLoopResultBuilder]: For program point L234(lines 234 338) no Hoare annotation was computed. [2022-11-25 18:24:53,616 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 272) no Hoare annotation was computed. [2022-11-25 18:24:53,616 INFO L899 garLoopResultBuilder]: For program point L135(lines 135 397) no Hoare annotation was computed. [2022-11-25 18:24:53,616 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-25 18:24:53,617 INFO L899 garLoopResultBuilder]: For program point L284(line 284) no Hoare annotation was computed. [2022-11-25 18:24:53,617 INFO L899 garLoopResultBuilder]: For program point L53(lines 53 433) no Hoare annotation was computed. [2022-11-25 18:24:53,617 INFO L899 garLoopResultBuilder]: For program point L384(lines 384 393) no Hoare annotation was computed. [2022-11-25 18:24:53,617 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 255) no Hoare annotation was computed. [2022-11-25 18:24:53,618 INFO L895 garLoopResultBuilder]: At program point L401(lines 131 402) the Hoare annotation is: (and (not (<= |ULTIMATE.start_main_~main__urilen~0#1| |ULTIMATE.start_main_~main__cp~0#1|)) (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~3#1| 1) (let ((.cse0 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| 0))) (.cse1 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~1#1| 0))) (.cse2 (<= 1 |ULTIMATE.start_main_~main__cp~0#1|)) (.cse3 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~2#1| 0))) (.cse4 (not (<= |ULTIMATE.start_main_~main__scheme~0#1| 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~16#1| 0))) (and .cse0 .cse1 (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~2#1| 1) .cse2 .cse3 .cse4)))) [2022-11-25 18:24:53,618 INFO L899 garLoopResultBuilder]: For program point L104(lines 104 411) no Hoare annotation was computed. [2022-11-25 18:24:53,618 INFO L899 garLoopResultBuilder]: For program point L71(lines 71 416) no Hoare annotation was computed. [2022-11-25 18:24:53,618 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 177) no Hoare annotation was computed. [2022-11-25 18:24:53,618 INFO L899 garLoopResultBuilder]: For program point L253(lines 253 329) no Hoare annotation was computed. [2022-11-25 18:24:53,619 INFO L899 garLoopResultBuilder]: For program point L187(lines 187 355) no Hoare annotation was computed. [2022-11-25 18:24:53,619 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION(line 386) no Hoare annotation was computed. [2022-11-25 18:24:53,619 INFO L899 garLoopResultBuilder]: For program point L270(lines 270 322) no Hoare annotation was computed. [2022-11-25 18:24:53,619 INFO L899 garLoopResultBuilder]: For program point L204(lines 204 353) no Hoare annotation was computed. [2022-11-25 18:24:53,619 INFO L899 garLoopResultBuilder]: For program point L386(line 386) no Hoare annotation was computed. [2022-11-25 18:24:53,619 INFO L899 garLoopResultBuilder]: For program point L155(lines 155 360) no Hoare annotation was computed. [2022-11-25 18:24:53,620 INFO L899 garLoopResultBuilder]: For program point L23(lines 23 438) no Hoare annotation was computed. [2022-11-25 18:24:53,620 INFO L899 garLoopResultBuilder]: For program point L255(line 255) no Hoare annotation was computed. [2022-11-25 18:24:53,620 INFO L899 garLoopResultBuilder]: For program point L189(line 189) no Hoare annotation was computed. [2022-11-25 18:24:53,620 INFO L899 garLoopResultBuilder]: For program point L123(lines 123 403) no Hoare annotation was computed. [2022-11-25 18:24:53,620 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 214) no Hoare annotation was computed. [2022-11-25 18:24:53,620 INFO L899 garLoopResultBuilder]: For program point L272(line 272) no Hoare annotation was computed. [2022-11-25 18:24:53,621 INFO L899 garLoopResultBuilder]: For program point L41(lines 41 435) no Hoare annotation was computed. [2022-11-25 18:24:53,621 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-25 18:24:53,621 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 189) no Hoare annotation was computed. [2022-11-25 18:24:53,621 INFO L899 garLoopResultBuilder]: For program point L157(line 157) no Hoare annotation was computed. [2022-11-25 18:24:53,621 INFO L899 garLoopResultBuilder]: For program point L372(lines 372 395) no Hoare annotation was computed. [2022-11-25 18:24:53,621 INFO L899 garLoopResultBuilder]: For program point L306(lines 306 316) no Hoare annotation was computed. [2022-11-25 18:24:53,622 INFO L899 garLoopResultBuilder]: For program point L224(lines 224 344) no Hoare annotation was computed. [2022-11-25 18:24:53,622 INFO L899 garLoopResultBuilder]: For program point L125(line 125) no Hoare annotation was computed. [2022-11-25 18:24:53,622 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 432) no Hoare annotation was computed. [2022-11-25 18:24:53,622 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 113) no Hoare annotation was computed. [2022-11-25 18:24:53,622 INFO L899 garLoopResultBuilder]: For program point L241(lines 241 331) no Hoare annotation was computed. [2022-11-25 18:24:53,622 INFO L899 garLoopResultBuilder]: For program point L175(lines 175 357) no Hoare annotation was computed. [2022-11-25 18:24:53,623 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 284) no Hoare annotation was computed. [2022-11-25 18:24:53,623 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 226) no Hoare annotation was computed. [2022-11-25 18:24:53,623 INFO L899 garLoopResultBuilder]: For program point L374(line 374) no Hoare annotation was computed. [2022-11-25 18:24:53,623 INFO L899 garLoopResultBuilder]: For program point L308(line 308) no Hoare annotation was computed. [2022-11-25 18:24:53,623 INFO L899 garLoopResultBuilder]: For program point L143(lines 143 362) no Hoare annotation was computed. [2022-11-25 18:24:53,623 INFO L899 garLoopResultBuilder]: For program point L226(line 226) no Hoare annotation was computed. [2022-11-25 18:24:53,624 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 145) no Hoare annotation was computed. [2022-11-25 18:24:53,624 INFO L899 garLoopResultBuilder]: For program point L61(lines 61 427) no Hoare annotation was computed. [2022-11-25 18:24:53,624 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-25 18:24:53,624 INFO L899 garLoopResultBuilder]: For program point L243(line 243) no Hoare annotation was computed. [2022-11-25 18:24:53,624 INFO L899 garLoopResultBuilder]: For program point L177(line 177) no Hoare annotation was computed. [2022-11-25 18:24:53,624 INFO L899 garLoopResultBuilder]: For program point L111(lines 111 405) no Hoare annotation was computed. [2022-11-25 18:24:53,625 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 308) no Hoare annotation was computed. [2022-11-25 18:24:53,625 INFO L895 garLoopResultBuilder]: At program point L392(lines 129 403) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| 0))) (.cse1 (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~3#1| 1)) (.cse2 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~1#1| 0))) (.cse3 (< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)) (.cse4 (<= 1 |ULTIMATE.start_main_~main__cp~0#1|)) (.cse5 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~2#1| 0))) (.cse6 (not (<= |ULTIMATE.start_main_~main__scheme~0#1| 0)))) (or (and .cse0 .cse1 .cse2 .cse3 (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~2#1| 1) .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~17#1| 0)) .cse4 .cse5 (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~16#1| 1) .cse6))) [2022-11-25 18:24:53,625 INFO L899 garLoopResultBuilder]: For program point L194(lines 194 354) no Hoare annotation was computed. [2022-11-25 18:24:53,625 INFO L899 garLoopResultBuilder]: For program point L95(lines 95 412) no Hoare annotation was computed. [2022-11-25 18:24:53,625 INFO L899 garLoopResultBuilder]: For program point L29(lines 29 437) no Hoare annotation was computed. [2022-11-25 18:24:53,626 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 125) no Hoare annotation was computed. [2022-11-25 18:24:53,626 INFO L899 garLoopResultBuilder]: For program point L145(line 145) no Hoare annotation was computed. [2022-11-25 18:24:53,626 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 296) no Hoare annotation was computed. [2022-11-25 18:24:53,627 INFO L895 garLoopResultBuilder]: At program point L327(lines 262 328) the Hoare annotation is: (and (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~10#1| 1) (let ((.cse0 (let ((.cse1 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~6#1| 0))) (.cse2 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| 0))) (.cse3 (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~3#1| 1)) (.cse4 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~1#1| 0))) (.cse5 (< 0 |ULTIMATE.start_main_~main__scheme~0#1|)) (.cse6 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~10#1| 0))) (.cse7 (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~4#1| 1)) (.cse8 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~11#1| 0))) (.cse9 (<= 1 |ULTIMATE.start_main_~main__cp~0#1|)) (.cse10 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~2#1| 0))) (.cse11 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~8#1| 0))) (.cse12 (< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)) (.cse13 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~5#1| 0))) (.cse14 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~7#1| 0)))) (or (and .cse1 .cse2 (<= (+ 2 |ULTIMATE.start_main_~main__c~0#1|) |ULTIMATE.start_main_~main__tokenlen~0#1|) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~12#1| 0)) .cse13 .cse14))))) (or (and .cse0 (<= 1 |ULTIMATE.start_main_~main__c~0#1|) (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~13#1| 0))) (and .cse0 (= |ULTIMATE.start_main_~main__c~0#1| 0)))) (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~9#1| 1)) [2022-11-25 18:24:53,627 INFO L899 garLoopResultBuilder]: For program point L294(lines 294 318) no Hoare annotation was computed. [2022-11-25 18:24:53,627 INFO L899 garLoopResultBuilder]: For program point L162(lines 162 359) no Hoare annotation was computed. [2022-11-25 18:24:53,627 INFO L899 garLoopResultBuilder]: For program point L63(lines 63 422) no Hoare annotation was computed. [2022-11-25 18:24:53,627 INFO L895 garLoopResultBuilder]: At program point L410(lines 104 411) the Hoare annotation is: (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| 0)) [2022-11-25 18:24:53,628 INFO L899 garLoopResultBuilder]: For program point L212(lines 212 346) no Hoare annotation was computed. [2022-11-25 18:24:53,628 INFO L899 garLoopResultBuilder]: For program point L113(line 113) no Hoare annotation was computed. [2022-11-25 18:24:53,628 INFO L899 garLoopResultBuilder]: For program point L47(lines 47 434) no Hoare annotation was computed. [2022-11-25 18:24:53,628 INFO L899 garLoopResultBuilder]: For program point L262(lines 262 328) no Hoare annotation was computed. [2022-11-25 18:24:53,628 INFO L899 garLoopResultBuilder]: For program point L97(line 97) no Hoare annotation was computed. [2022-11-25 18:24:53,629 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 157) no Hoare annotation was computed. [2022-11-25 18:24:53,629 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 374) no Hoare annotation was computed. [2022-11-25 18:24:53,629 INFO L899 garLoopResultBuilder]: For program point L296(line 296) no Hoare annotation was computed. [2022-11-25 18:24:53,629 INFO L899 garLoopResultBuilder]: For program point L65(lines 65 417) no Hoare annotation was computed. [2022-11-25 18:24:53,629 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-25 18:24:53,629 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 85) no Hoare annotation was computed. [2022-11-25 18:24:53,630 INFO L899 garLoopResultBuilder]: For program point L214(line 214) no Hoare annotation was computed. [2022-11-25 18:24:53,630 INFO L899 garLoopResultBuilder]: For program point L83(lines 83 414) no Hoare annotation was computed. [2022-11-25 18:24:53,630 INFO L895 garLoopResultBuilder]: At program point L315(lines 230 344) the Hoare annotation is: (let ((.cse13 (= |ULTIMATE.start_main_~main__c~0#1| 0)) (.cse0 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~6#1| 0))) (.cse1 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| 0))) (.cse2 (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~3#1| 1)) (.cse3 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~1#1| 0))) (.cse4 (< 0 |ULTIMATE.start_main_~main__scheme~0#1|)) (.cse5 (< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)) (.cse6 (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~4#1| 1)) (.cse7 (<= 1 |ULTIMATE.start_main_~main__cp~0#1|)) (.cse8 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~2#1| 0))) (.cse9 (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~9#1| 1)) (.cse10 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~8#1| 0))) (.cse11 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~5#1| 0))) (.cse12 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~7#1| 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~8#1| 1) .cse7 .cse8 .cse9 .cse10 (< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|) .cse11 .cse12 .cse13) (and (let ((.cse14 (let ((.cse15 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~10#1| 0))) (.cse16 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~11#1| 0)))) (or (and .cse0 .cse1 (<= (+ 2 |ULTIMATE.start_main_~main__c~0#1|) |ULTIMATE.start_main_~main__tokenlen~0#1|) .cse2 .cse3 .cse4 .cse5 .cse15 .cse6 .cse16 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse6 .cse16 .cse7 .cse8 .cse9 .cse10 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~12#1| 0)) .cse11 .cse12))))) (or (and .cse14 .cse13) (and (<= 1 |ULTIMATE.start_main_~main__c~0#1|) (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~13#1| 0)) .cse14))) (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~10#1| 1)))) [2022-11-25 18:24:53,631 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 243) no Hoare annotation was computed. [2022-11-25 18:24:53,631 INFO L899 garLoopResultBuilder]: For program point L282(lines 282 320) no Hoare annotation was computed. [2022-11-25 18:24:53,631 INFO L902 garLoopResultBuilder]: At program point L431(lines 13 439) the Hoare annotation is: true [2022-11-25 18:24:53,631 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 436) no Hoare annotation was computed. [2022-11-25 18:24:53,635 INFO L445 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, 1, 1] [2022-11-25 18:24:53,638 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 18:24:53,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 06:24:53 BoogieIcfgContainer [2022-11-25 18:24:53,664 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 18:24:53,664 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 18:24:53,664 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 18:24:53,665 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 18:24:53,665 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:24:22" (3/4) ... [2022-11-25 18:24:53,669 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-25 18:24:53,684 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-11-25 18:24:53,684 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-25 18:24:53,685 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-25 18:24:53,685 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-25 18:24:53,763 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cac1803-fa3f-45d1-ab47-2f0f3fac6baf/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 18:24:53,763 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 18:24:53,764 INFO L158 Benchmark]: Toolchain (without parser) took 32878.82ms. Allocated memory was 153.1MB in the beginning and 490.7MB in the end (delta: 337.6MB). Free memory was 116.2MB in the beginning and 372.6MB in the end (delta: -256.4MB). Peak memory consumption was 84.4MB. Max. memory is 16.1GB. [2022-11-25 18:24:53,764 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 109.1MB. Free memory was 75.9MB in the beginning and 75.9MB in the end (delta: 25.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 18:24:53,765 INFO L158 Benchmark]: CACSL2BoogieTranslator took 441.46ms. Allocated memory is still 153.1MB. Free memory was 115.4MB in the beginning and 95.8MB in the end (delta: 19.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-25 18:24:53,766 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.46ms. Allocated memory is still 153.1MB. Free memory was 95.8MB in the beginning and 93.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 18:24:53,767 INFO L158 Benchmark]: Boogie Preprocessor took 33.25ms. Allocated memory is still 153.1MB. Free memory was 93.6MB in the beginning and 92.4MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 18:24:53,767 INFO L158 Benchmark]: RCFGBuilder took 673.48ms. Allocated memory is still 153.1MB. Free memory was 92.4MB in the beginning and 74.6MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-25 18:24:53,770 INFO L158 Benchmark]: TraceAbstraction took 31570.97ms. Allocated memory was 153.1MB in the beginning and 490.7MB in the end (delta: 337.6MB). Free memory was 73.5MB in the beginning and 377.8MB in the end (delta: -304.3MB). Peak memory consumption was 243.9MB. Max. memory is 16.1GB. [2022-11-25 18:24:53,770 INFO L158 Benchmark]: Witness Printer took 99.31ms. Allocated memory is still 490.7MB. Free memory was 377.8MB in the beginning and 372.6MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-25 18:24:53,780 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.34ms. Allocated memory is still 109.1MB. Free memory was 75.9MB in the beginning and 75.9MB in the end (delta: 25.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 441.46ms. Allocated memory is still 153.1MB. Free memory was 115.4MB in the beginning and 95.8MB in the end (delta: 19.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.46ms. Allocated memory is still 153.1MB. Free memory was 95.8MB in the beginning and 93.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.25ms. Allocated memory is still 153.1MB. Free memory was 93.6MB in the beginning and 92.4MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 673.48ms. Allocated memory is still 153.1MB. Free memory was 92.4MB in the beginning and 74.6MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 31570.97ms. Allocated memory was 153.1MB in the beginning and 490.7MB in the end (delta: 337.6MB). Free memory was 73.5MB in the beginning and 377.8MB in the end (delta: -304.3MB). Peak memory consumption was 243.9MB. Max. memory is 16.1GB. * Witness Printer took 99.31ms. Allocated memory is still 490.7MB. Free memory was 377.8MB in the beginning and 372.6MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. 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: 85]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 97]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 113]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 125]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 145]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 157]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 177]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 189]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 214]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 226]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 243]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 255]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 272]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 284]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 296]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 308]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 374]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 386]: 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, 82 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 31.4s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 23.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2176 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2176 mSDsluCounter, 2684 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1437 mSDsCounter, 65 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1152 IncrementalHoareTripleChecker+Invalid, 1217 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 65 mSolverCounterUnsat, 1247 mSDtfsCounter, 1152 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 342 GetRequests, 212 SyntacticMatches, 19 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred in iteration=0, InterpolantAutomatonStates: 129, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 23 MinimizatonAttempts, 300 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 16 NumberOfFragments, 696 HoareAnnotationTreeSize, 6 FomulaSimplifications, 68212 FormulaSimplificationTreeSizeReduction, 22.4s HoareSimplificationTime, 6 FomulaSimplificationsInter, 312853 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 751 NumberOfCodeBlocks, 751 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 815 ConstructedInterpolants, 0 QuantifiedInterpolants, 1798 SizeOfPredicates, 12 NumberOfNonLiveVariables, 362 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 29 InterpolantComputations, 20 PerfectInterpolantSequences, 11/29 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 18 specifications checked. All of them hold - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 230]: Loop Invariant Derived loop invariant: (((((((((((((((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && main__cp < main__urilen) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 < main__urilen) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__c == 0) || (((((((((((((((((((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && 2 + main__c <= main__tokenlen) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && main__cp < main__urilen) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) || (((((((((((((((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && main__cp < main__urilen) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0))) && main__c == 0) || ((1 <= main__c && !(__VERIFIER_assert__cond == 0)) && ((((((((((((((((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && 2 + main__c <= main__tokenlen) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && main__cp < main__urilen) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) || (((((((((((((((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && main__cp < main__urilen) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0))))) && __VERIFIER_assert__cond == 1) - InvariantResult [Line: 262]: Loop Invariant Derived loop invariant: (__VERIFIER_assert__cond == 1 && ((((((((((((((((((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && 2 + main__c <= main__tokenlen) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 < main__urilen) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) || ((((((((((((((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 < main__urilen) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0))) && 1 <= main__c) && !(__VERIFIER_assert__cond == 0)) || ((((((((((((((((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && 2 + main__c <= main__tokenlen) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 < main__urilen) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) || ((((((((((((((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 < main__urilen) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0))) && main__c == 0))) && __VERIFIER_assert__cond == 1 - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: !(__VERIFIER_assert__cond == 0) - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: (((((((!(__VERIFIER_assert__cond == 0) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && main__cp < main__urilen) && __VERIFIER_assert__cond == 1) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(main__scheme <= 0)) || ((((((((!(__VERIFIER_assert__cond == 0) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && main__cp < main__urilen) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(main__scheme <= 0)) - InvariantResult [Line: 131]: Loop Invariant Derived loop invariant: (!(main__urilen <= main__cp) && __VERIFIER_assert__cond == 1) && ((((((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(main__scheme <= 0)) && !(__VERIFIER_assert__cond == 0)) || (((((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(main__scheme <= 0))) RESULT: Ultimate proved your program to be correct! [2022-11-25 18:24:53,846 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9cac1803-fa3f-45d1-ab47-2f0f3fac6baf/bin/uautomizer-ZsLfNo2U6R/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