./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 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_a73d8a12-8786-4959-a7c5-8941c5c6f140/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a73d8a12-8786-4959-a7c5-8941c5c6f140/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a73d8a12-8786-4959-a7c5-8941c5c6f140/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a73d8a12-8786-4959-a7c5-8941c5c6f140/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a73d8a12-8786-4959-a7c5-8941c5c6f140/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a73d8a12-8786-4959-a7c5-8941c5c6f140/bin/uautomizer-uyxdKDjOR8 --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 133ba40f5b51c272364c51a4e246bcd97a40cd88b0bcd4bd92df8f8d6bb23a52 --- 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-2329fc7 [2022-12-13 22:20:00,066 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 22:20:00,068 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 22:20:00,081 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 22:20:00,081 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 22:20:00,082 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 22:20:00,083 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 22:20:00,084 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 22:20:00,085 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 22:20:00,086 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 22:20:00,087 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 22:20:00,087 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 22:20:00,088 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 22:20:00,088 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 22:20:00,089 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 22:20:00,090 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 22:20:00,090 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 22:20:00,091 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 22:20:00,092 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 22:20:00,093 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 22:20:00,094 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 22:20:00,096 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 22:20:00,098 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 22:20:00,099 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 22:20:00,102 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 22:20:00,102 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 22:20:00,102 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 22:20:00,103 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 22:20:00,103 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 22:20:00,104 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 22:20:00,104 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 22:20:00,105 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 22:20:00,105 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 22:20:00,106 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 22:20:00,107 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 22:20:00,107 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 22:20:00,107 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 22:20:00,108 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 22:20:00,108 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 22:20:00,108 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 22:20:00,109 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 22:20:00,110 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a73d8a12-8786-4959-a7c5-8941c5c6f140/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 22:20:00,125 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 22:20:00,125 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 22:20:00,125 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 22:20:00,125 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 22:20:00,126 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 22:20:00,126 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 22:20:00,127 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 22:20:00,127 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 22:20:00,127 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 22:20:00,127 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 22:20:00,127 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 22:20:00,127 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 22:20:00,128 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 22:20:00,128 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 22:20:00,128 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 22:20:00,128 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 22:20:00,128 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 22:20:00,128 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 22:20:00,128 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 22:20:00,129 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 22:20:00,129 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 22:20:00,129 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 22:20:00,129 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 22:20:00,129 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 22:20:00,130 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 22:20:00,130 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 22:20:00,130 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 22:20:00,130 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 22:20:00,130 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 22:20:00,130 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 22:20:00,131 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 22:20:00,131 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 22:20:00,131 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 22:20:00,131 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 22:20:00,131 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 22:20:00,131 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_a73d8a12-8786-4959-a7c5-8941c5c6f140/bin/uautomizer-uyxdKDjOR8/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_a73d8a12-8786-4959-a7c5-8941c5c6f140/bin/uautomizer-uyxdKDjOR8 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 -> 133ba40f5b51c272364c51a4e246bcd97a40cd88b0bcd4bd92df8f8d6bb23a52 [2022-12-13 22:20:00,301 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 22:20:00,321 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 22:20:00,323 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 22:20:00,324 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 22:20:00,325 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 22:20:00,326 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a73d8a12-8786-4959-a7c5-8941c5c6f140/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c [2022-12-13 22:20:02,947 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 22:20:03,094 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 22:20:03,094 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a73d8a12-8786-4959-a7c5-8941c5c6f140/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c [2022-12-13 22:20:03,101 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a73d8a12-8786-4959-a7c5-8941c5c6f140/bin/uautomizer-uyxdKDjOR8/data/8a145ed98/5377bc7cbae94e4987a4a12c91d51f9c/FLAGb71947c45 [2022-12-13 22:20:03,116 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a73d8a12-8786-4959-a7c5-8941c5c6f140/bin/uautomizer-uyxdKDjOR8/data/8a145ed98/5377bc7cbae94e4987a4a12c91d51f9c [2022-12-13 22:20:03,119 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 22:20:03,120 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 22:20:03,122 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 22:20:03,122 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 22:20:03,125 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 22:20:03,126 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 10:20:03" (1/1) ... [2022-12-13 22:20:03,126 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7161de13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:20:03, skipping insertion in model container [2022-12-13 22:20:03,127 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 10:20:03" (1/1) ... [2022-12-13 22:20:03,134 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 22:20:03,159 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 22:20:03,317 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_a73d8a12-8786-4959-a7c5-8941c5c6f140/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[1224,1237] [2022-12-13 22:20:03,323 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_a73d8a12-8786-4959-a7c5-8941c5c6f140/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[1636,1649] [2022-12-13 22:20:03,324 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_a73d8a12-8786-4959-a7c5-8941c5c6f140/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[1851,1864] [2022-12-13 22:20:03,327 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_a73d8a12-8786-4959-a7c5-8941c5c6f140/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[2384,2397] [2022-12-13 22:20:03,329 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_a73d8a12-8786-4959-a7c5-8941c5c6f140/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[2599,2612] [2022-12-13 22:20:03,331 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_a73d8a12-8786-4959-a7c5-8941c5c6f140/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[2901,2914] [2022-12-13 22:20:03,334 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_a73d8a12-8786-4959-a7c5-8941c5c6f140/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3116,3129] [2022-12-13 22:20:03,336 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_a73d8a12-8786-4959-a7c5-8941c5c6f140/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3386,3399] [2022-12-13 22:20:03,338 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_a73d8a12-8786-4959-a7c5-8941c5c6f140/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3604,3617] [2022-12-13 22:20:03,341 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_a73d8a12-8786-4959-a7c5-8941c5c6f140/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[4088,4101] [2022-12-13 22:20:03,343 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_a73d8a12-8786-4959-a7c5-8941c5c6f140/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[4306,4319] [2022-12-13 22:20:03,345 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_a73d8a12-8786-4959-a7c5-8941c5c6f140/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[4802,4815] [2022-12-13 22:20:03,347 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_a73d8a12-8786-4959-a7c5-8941c5c6f140/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[5203,5216] [2022-12-13 22:20:03,348 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_a73d8a12-8786-4959-a7c5-8941c5c6f140/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[5421,5434] [2022-12-13 22:20:03,350 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_a73d8a12-8786-4959-a7c5-8941c5c6f140/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[5792,5805] [2022-12-13 22:20:03,352 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_a73d8a12-8786-4959-a7c5-8941c5c6f140/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[6010,6023] [2022-12-13 22:20:03,353 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_a73d8a12-8786-4959-a7c5-8941c5c6f140/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[6296,6309] [2022-12-13 22:20:03,354 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_a73d8a12-8786-4959-a7c5-8941c5c6f140/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[6514,6527] [2022-12-13 22:20:03,356 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 22:20:03,367 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 22:20:03,379 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_a73d8a12-8786-4959-a7c5-8941c5c6f140/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[1224,1237] [2022-12-13 22:20:03,381 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_a73d8a12-8786-4959-a7c5-8941c5c6f140/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[1636,1649] [2022-12-13 22:20:03,382 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_a73d8a12-8786-4959-a7c5-8941c5c6f140/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[1851,1864] [2022-12-13 22:20:03,384 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_a73d8a12-8786-4959-a7c5-8941c5c6f140/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[2384,2397] [2022-12-13 22:20:03,385 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_a73d8a12-8786-4959-a7c5-8941c5c6f140/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[2599,2612] [2022-12-13 22:20:03,387 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_a73d8a12-8786-4959-a7c5-8941c5c6f140/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[2901,2914] [2022-12-13 22:20:03,388 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_a73d8a12-8786-4959-a7c5-8941c5c6f140/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3116,3129] [2022-12-13 22:20:03,389 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_a73d8a12-8786-4959-a7c5-8941c5c6f140/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3386,3399] [2022-12-13 22:20:03,400 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_a73d8a12-8786-4959-a7c5-8941c5c6f140/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[3604,3617] [2022-12-13 22:20:03,402 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_a73d8a12-8786-4959-a7c5-8941c5c6f140/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[4088,4101] [2022-12-13 22:20:03,403 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_a73d8a12-8786-4959-a7c5-8941c5c6f140/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[4306,4319] [2022-12-13 22:20:03,404 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_a73d8a12-8786-4959-a7c5-8941c5c6f140/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[4802,4815] [2022-12-13 22:20:03,405 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_a73d8a12-8786-4959-a7c5-8941c5c6f140/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[5203,5216] [2022-12-13 22:20:03,406 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_a73d8a12-8786-4959-a7c5-8941c5c6f140/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[5421,5434] [2022-12-13 22:20:03,407 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_a73d8a12-8786-4959-a7c5-8941c5c6f140/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[5792,5805] [2022-12-13 22:20:03,408 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_a73d8a12-8786-4959-a7c5-8941c5c6f140/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[6010,6023] [2022-12-13 22:20:03,409 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_a73d8a12-8786-4959-a7c5-8941c5c6f140/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[6296,6309] [2022-12-13 22:20:03,410 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_a73d8a12-8786-4959-a7c5-8941c5c6f140/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c[6514,6527] [2022-12-13 22:20:03,411 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 22:20:03,426 INFO L208 MainTranslator]: Completed translation [2022-12-13 22:20:03,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:20:03 WrapperNode [2022-12-13 22:20:03,427 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 22:20:03,428 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 22:20:03,428 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 22:20:03,428 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 22:20:03,433 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:20:03" (1/1) ... [2022-12-13 22:20:03,439 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:20:03" (1/1) ... [2022-12-13 22:20:03,459 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 244 [2022-12-13 22:20:03,460 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 22:20:03,460 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 22:20:03,460 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 22:20:03,461 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 22:20:03,470 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:20:03" (1/1) ... [2022-12-13 22:20:03,470 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:20:03" (1/1) ... [2022-12-13 22:20:03,472 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:20:03" (1/1) ... [2022-12-13 22:20:03,473 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:20:03" (1/1) ... [2022-12-13 22:20:03,477 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:20:03" (1/1) ... [2022-12-13 22:20:03,480 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:20:03" (1/1) ... [2022-12-13 22:20:03,482 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:20:03" (1/1) ... [2022-12-13 22:20:03,483 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:20:03" (1/1) ... [2022-12-13 22:20:03,485 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 22:20:03,486 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 22:20:03,487 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 22:20:03,487 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 22:20:03,488 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:20:03" (1/1) ... [2022-12-13 22:20:03,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 22:20:03,508 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a73d8a12-8786-4959-a7c5-8941c5c6f140/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:20:03,520 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a73d8a12-8786-4959-a7c5-8941c5c6f140/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 22:20:03,523 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a73d8a12-8786-4959-a7c5-8941c5c6f140/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 22:20:03,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 22:20:03,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 22:20:03,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 22:20:03,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 22:20:03,622 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 22:20:03,624 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 22:20:03,815 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 22:20:03,822 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 22:20:03,822 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 22:20:03,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:20:03 BoogieIcfgContainer [2022-12-13 22:20:03,824 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 22:20:03,827 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 22:20:03,827 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 22:20:03,830 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 22:20:03,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 10:20:03" (1/3) ... [2022-12-13 22:20:03,831 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66374fa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 10:20:03, skipping insertion in model container [2022-12-13 22:20:03,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:20:03" (2/3) ... [2022-12-13 22:20:03,831 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66374fa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 10:20:03, skipping insertion in model container [2022-12-13 22:20:03,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:20:03" (3/3) ... [2022-12-13 22:20:03,833 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+lhb-reducer.c [2022-12-13 22:20:03,848 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 22:20:03,849 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-12-13 22:20:03,895 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 22:20:03,900 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;@614e0808, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 22:20:03,900 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2022-12-13 22:20:03,903 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 56 states have (on average 1.8571428571428572) internal successors, (104), 74 states have internal predecessors, (104), 0 states have call successors, (0), 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-12-13 22:20:03,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-13 22:20:03,908 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:20:03,908 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:20:03,908 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-12-13 22:20:03,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:20:03,912 INFO L85 PathProgramCache]: Analyzing trace with hash 123910062, now seen corresponding path program 1 times [2022-12-13 22:20:03,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:20:03,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905046306] [2022-12-13 22:20:03,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:20:03,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:20:04,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:20:04,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:20:04,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:20:04,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905046306] [2022-12-13 22:20:04,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905046306] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:20:04,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:20:04,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 22:20:04,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816019100] [2022-12-13 22:20:04,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:20:04,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 22:20:04,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:20:04,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 22:20:04,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 22:20:04,189 INFO L87 Difference]: Start difference. First operand has 75 states, 56 states have (on average 1.8571428571428572) internal successors, (104), 74 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:20:04,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:20:04,288 INFO L93 Difference]: Finished difference Result 123 states and 164 transitions. [2022-12-13 22:20:04,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 22:20:04,290 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-12-13 22:20:04,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:20:04,296 INFO L225 Difference]: With dead ends: 123 [2022-12-13 22:20:04,296 INFO L226 Difference]: Without dead ends: 107 [2022-12-13 22:20:04,298 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-12-13 22:20:04,301 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 82 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 22:20:04,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 250 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 22:20:04,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-12-13 22:20:04,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 69. [2022-12-13 22:20:04,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 68 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-12-13 22:20:04,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2022-12-13 22:20:04,327 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 8 [2022-12-13 22:20:04,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:20:04,327 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2022-12-13 22:20:04,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:20:04,327 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2022-12-13 22:20:04,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-13 22:20:04,328 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:20:04,328 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:20:04,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 22:20:04,328 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-12-13 22:20:04,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:20:04,329 INFO L85 PathProgramCache]: Analyzing trace with hash 120339118, now seen corresponding path program 1 times [2022-12-13 22:20:04,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:20:04,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343721112] [2022-12-13 22:20:04,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:20:04,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:20:04,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:20:04,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:20:04,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:20:04,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343721112] [2022-12-13 22:20:04,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343721112] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:20:04,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:20:04,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 22:20:04,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611989206] [2022-12-13 22:20:04,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:20:04,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 22:20:04,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:20:04,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 22:20:04,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 22:20:04,403 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:20:04,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:20:04,463 INFO L93 Difference]: Finished difference Result 107 states and 113 transitions. [2022-12-13 22:20:04,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 22:20:04,463 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-12-13 22:20:04,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:20:04,464 INFO L225 Difference]: With dead ends: 107 [2022-12-13 22:20:04,464 INFO L226 Difference]: Without dead ends: 105 [2022-12-13 22:20:04,465 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-12-13 22:20:04,466 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 45 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 22:20:04,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 165 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 22:20:04,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-12-13 22:20:04,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 67. [2022-12-13 22:20:04,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 51 states have (on average 1.392156862745098) internal successors, (71), 66 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-12-13 22:20:04,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2022-12-13 22:20:04,474 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 8 [2022-12-13 22:20:04,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:20:04,474 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2022-12-13 22:20:04,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:20:04,475 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2022-12-13 22:20:04,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-13 22:20:04,475 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:20:04,476 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:20:04,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 22:20:04,476 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-12-13 22:20:04,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:20:04,477 INFO L85 PathProgramCache]: Analyzing trace with hash 2031737892, now seen corresponding path program 1 times [2022-12-13 22:20:04,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:20:04,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865296901] [2022-12-13 22:20:04,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:20:04,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:20:04,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:20:04,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:20:04,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:20:04,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865296901] [2022-12-13 22:20:04,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865296901] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:20:04,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:20:04,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 22:20:04,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864642201] [2022-12-13 22:20:04,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:20:04,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 22:20:04,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:20:04,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 22:20:04,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 22:20:04,544 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:20:04,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:20:04,613 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2022-12-13 22:20:04,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 22:20:04,614 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-12-13 22:20:04,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:20:04,614 INFO L225 Difference]: With dead ends: 69 [2022-12-13 22:20:04,615 INFO L226 Difference]: Without dead ends: 67 [2022-12-13 22:20:04,615 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-12-13 22:20:04,616 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 61 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 22:20:04,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 119 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 22:20:04,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-12-13 22:20:04,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2022-12-13 22:20:04,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 50 states have (on average 1.38) internal successors, (69), 64 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-12-13 22:20:04,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2022-12-13 22:20:04,620 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 11 [2022-12-13 22:20:04,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:20:04,621 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2022-12-13 22:20:04,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:20:04,621 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2022-12-13 22:20:04,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-13 22:20:04,621 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:20:04,621 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:20:04,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 22:20:04,622 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-12-13 22:20:04,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:20:04,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1271153903, now seen corresponding path program 1 times [2022-12-13 22:20:04,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:20:04,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303058909] [2022-12-13 22:20:04,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:20:04,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:20:04,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:20:04,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:20:04,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:20:04,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303058909] [2022-12-13 22:20:04,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303058909] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:20:04,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:20:04,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 22:20:04,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37250993] [2022-12-13 22:20:04,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:20:04,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 22:20:04,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:20:04,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 22:20:04,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 22:20:04,678 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:20:04,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:20:04,739 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2022-12-13 22:20:04,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 22:20:04,739 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-12-13 22:20:04,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:20:04,740 INFO L225 Difference]: With dead ends: 67 [2022-12-13 22:20:04,740 INFO L226 Difference]: Without dead ends: 65 [2022-12-13 22:20:04,741 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-12-13 22:20:04,742 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 59 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 22:20:04,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 113 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 22:20:04,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-12-13 22:20:04,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2022-12-13 22:20:04,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 62 states have internal predecessors, (67), 0 states have call successors, (0), 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-12-13 22:20:04,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2022-12-13 22:20:04,748 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 11 [2022-12-13 22:20:04,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:20:04,748 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2022-12-13 22:20:04,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:20:04,749 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2022-12-13 22:20:04,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-13 22:20:04,749 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:20:04,749 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:20:04,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 22:20:04,749 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-12-13 22:20:04,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:20:04,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1440630601, now seen corresponding path program 1 times [2022-12-13 22:20:04,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:20:04,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125633344] [2022-12-13 22:20:04,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:20:04,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:20:04,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:20:04,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:20:04,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:20:04,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125633344] [2022-12-13 22:20:04,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125633344] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:20:04,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:20:04,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 22:20:04,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433210478] [2022-12-13 22:20:04,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:20:04,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 22:20:04,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:20:04,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 22:20:04,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 22:20:04,792 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:20:04,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:20:04,832 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2022-12-13 22:20:04,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 22:20:04,833 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-12-13 22:20:04,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:20:04,833 INFO L225 Difference]: With dead ends: 65 [2022-12-13 22:20:04,833 INFO L226 Difference]: Without dead ends: 61 [2022-12-13 22:20:04,833 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-12-13 22:20:04,834 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 16 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 22:20:04,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 136 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 22:20:04,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-12-13 22:20:04,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2022-12-13 22:20:04,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 58 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:20:04,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2022-12-13 22:20:04,837 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 12 [2022-12-13 22:20:04,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:20:04,838 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2022-12-13 22:20:04,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:20:04,838 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2022-12-13 22:20:04,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-13 22:20:04,838 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:20:04,838 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:20:04,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 22:20:04,839 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-12-13 22:20:04,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:20:04,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1440142029, now seen corresponding path program 1 times [2022-12-13 22:20:04,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:20:04,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87380864] [2022-12-13 22:20:04,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:20:04,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:20:04,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:20:04,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:20:04,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:20:04,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87380864] [2022-12-13 22:20:04,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87380864] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:20:04,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:20:04,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 22:20:04,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304214119] [2022-12-13 22:20:04,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:20:04,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 22:20:04,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:20:04,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 22:20:04,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 22:20:04,882 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:20:04,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:20:04,948 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2022-12-13 22:20:04,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 22:20:04,949 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-12-13 22:20:04,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:20:04,950 INFO L225 Difference]: With dead ends: 95 [2022-12-13 22:20:04,950 INFO L226 Difference]: Without dead ends: 93 [2022-12-13 22:20:04,950 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-12-13 22:20:04,951 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 90 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 22:20:04,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 144 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 22:20:04,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-12-13 22:20:04,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 57. [2022-12-13 22:20:04,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 56 states have internal predecessors, (61), 0 states have call successors, (0), 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-12-13 22:20:04,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2022-12-13 22:20:04,955 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 12 [2022-12-13 22:20:04,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:20:04,955 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2022-12-13 22:20:04,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:20:04,955 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2022-12-13 22:20:04,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-13 22:20:04,956 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:20:04,956 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:20:04,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 22:20:04,956 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-12-13 22:20:04,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:20:04,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1440126141, now seen corresponding path program 1 times [2022-12-13 22:20:04,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:20:04,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299734633] [2022-12-13 22:20:04,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:20:04,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:20:04,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:20:05,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:20:05,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:20:05,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299734633] [2022-12-13 22:20:05,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299734633] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:20:05,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:20:05,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 22:20:05,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221312905] [2022-12-13 22:20:05,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:20:05,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 22:20:05,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:20:05,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 22:20:05,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 22:20:05,004 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:20:05,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:20:05,089 INFO L93 Difference]: Finished difference Result 100 states and 107 transitions. [2022-12-13 22:20:05,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 22:20:05,089 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-12-13 22:20:05,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:20:05,090 INFO L225 Difference]: With dead ends: 100 [2022-12-13 22:20:05,090 INFO L226 Difference]: Without dead ends: 98 [2022-12-13 22:20:05,090 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-12-13 22:20:05,091 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 95 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 22:20:05,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 144 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 22:20:05,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-12-13 22:20:05,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 55. [2022-12-13 22:20:05,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 54 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-12-13 22:20:05,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2022-12-13 22:20:05,095 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 12 [2022-12-13 22:20:05,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:20:05,095 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2022-12-13 22:20:05,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:20:05,095 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2022-12-13 22:20:05,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-13 22:20:05,095 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:20:05,096 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:20:05,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 22:20:05,096 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-12-13 22:20:05,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:20:05,096 INFO L85 PathProgramCache]: Analyzing trace with hash -751061257, now seen corresponding path program 1 times [2022-12-13 22:20:05,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:20:05,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806770420] [2022-12-13 22:20:05,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:20:05,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:20:05,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:20:05,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:20:05,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:20:05,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806770420] [2022-12-13 22:20:05,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806770420] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:20:05,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:20:05,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 22:20:05,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172525634] [2022-12-13 22:20:05,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:20:05,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 22:20:05,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:20:05,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 22:20:05,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 22:20:05,131 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:20:05,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:20:05,167 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2022-12-13 22:20:05,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 22:20:05,167 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-12-13 22:20:05,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:20:05,168 INFO L225 Difference]: With dead ends: 57 [2022-12-13 22:20:05,168 INFO L226 Difference]: Without dead ends: 53 [2022-12-13 22:20:05,168 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-12-13 22:20:05,168 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 13 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 22:20:05,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 118 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 22:20:05,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-12-13 22:20:05,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2022-12-13 22:20:05,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 50 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-12-13 22:20:05,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2022-12-13 22:20:05,172 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 12 [2022-12-13 22:20:05,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:20:05,172 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2022-12-13 22:20:05,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:20:05,173 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2022-12-13 22:20:05,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-13 22:20:05,173 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:20:05,173 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:20:05,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 22:20:05,173 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-12-13 22:20:05,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:20:05,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1694725733, now seen corresponding path program 1 times [2022-12-13 22:20:05,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:20:05,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568835647] [2022-12-13 22:20:05,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:20:05,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:20:05,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:20:05,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:20:05,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:20:05,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568835647] [2022-12-13 22:20:05,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568835647] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:20:05,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:20:05,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 22:20:05,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866270160] [2022-12-13 22:20:05,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:20:05,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 22:20:05,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:20:05,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 22:20:05,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 22:20:05,276 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:20:05,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:20:05,381 INFO L93 Difference]: Finished difference Result 118 states and 127 transitions. [2022-12-13 22:20:05,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 22:20:05,381 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-12-13 22:20:05,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:20:05,382 INFO L225 Difference]: With dead ends: 118 [2022-12-13 22:20:05,382 INFO L226 Difference]: Without dead ends: 116 [2022-12-13 22:20:05,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 22:20:05,383 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 68 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 22:20:05,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 223 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 22:20:05,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-12-13 22:20:05,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 56. [2022-12-13 22:20:05,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 46 states have (on average 1.326086956521739) internal successors, (61), 55 states have internal predecessors, (61), 0 states have call successors, (0), 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-12-13 22:20:05,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2022-12-13 22:20:05,391 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 13 [2022-12-13 22:20:05,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:20:05,392 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2022-12-13 22:20:05,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:20:05,392 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-12-13 22:20:05,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-13 22:20:05,392 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:20:05,392 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:20:05,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 22:20:05,393 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-12-13 22:20:05,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:20:05,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1694233189, now seen corresponding path program 1 times [2022-12-13 22:20:05,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:20:05,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780975401] [2022-12-13 22:20:05,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:20:05,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:20:05,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:20:05,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:20:05,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:20:05,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780975401] [2022-12-13 22:20:05,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780975401] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:20:05,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:20:05,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 22:20:05,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225275686] [2022-12-13 22:20:05,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:20:05,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 22:20:05,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:20:05,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 22:20:05,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 22:20:05,480 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:20:05,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:20:05,568 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2022-12-13 22:20:05,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 22:20:05,569 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-12-13 22:20:05,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:20:05,569 INFO L225 Difference]: With dead ends: 116 [2022-12-13 22:20:05,569 INFO L226 Difference]: Without dead ends: 114 [2022-12-13 22:20:05,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 22:20:05,570 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 80 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 22:20:05,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 195 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 22:20:05,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-12-13 22:20:05,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 58. [2022-12-13 22:20:05,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 48 states have (on average 1.3125) internal successors, (63), 57 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:20:05,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2022-12-13 22:20:05,574 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 13 [2022-12-13 22:20:05,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:20:05,574 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2022-12-13 22:20:05,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:20:05,574 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2022-12-13 22:20:05,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-13 22:20:05,575 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:20:05,575 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:20:05,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 22:20:05,575 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-12-13 22:20:05,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:20:05,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1791008026, now seen corresponding path program 1 times [2022-12-13 22:20:05,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:20:05,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484402590] [2022-12-13 22:20:05,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:20:05,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:20:05,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:20:05,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:20:05,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:20:05,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484402590] [2022-12-13 22:20:05,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484402590] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:20:05,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:20:05,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 22:20:05,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780590019] [2022-12-13 22:20:05,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:20:05,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 22:20:05,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:20:05,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 22:20:05,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 22:20:05,617 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:20:05,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:20:05,676 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2022-12-13 22:20:05,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 22:20:05,676 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-12-13 22:20:05,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:20:05,676 INFO L225 Difference]: With dead ends: 76 [2022-12-13 22:20:05,677 INFO L226 Difference]: Without dead ends: 74 [2022-12-13 22:20:05,677 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-12-13 22:20:05,677 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 69 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 22:20:05,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 103 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 22:20:05,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-12-13 22:20:05,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 56. [2022-12-13 22:20:05,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 47 states have (on average 1.297872340425532) internal successors, (61), 55 states have internal predecessors, (61), 0 states have call successors, (0), 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-12-13 22:20:05,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2022-12-13 22:20:05,681 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 13 [2022-12-13 22:20:05,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:20:05,681 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2022-12-13 22:20:05,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:20:05,681 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-12-13 22:20:05,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-13 22:20:05,682 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:20:05,682 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:20:05,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 22:20:05,682 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-12-13 22:20:05,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:20:05,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1789284122, now seen corresponding path program 1 times [2022-12-13 22:20:05,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:20:05,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557569501] [2022-12-13 22:20:05,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:20:05,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:20:05,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:20:05,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:20:05,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:20:05,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557569501] [2022-12-13 22:20:05,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557569501] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:20:05,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:20:05,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 22:20:05,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472660762] [2022-12-13 22:20:05,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:20:05,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 22:20:05,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:20:05,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 22:20:05,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 22:20:05,717 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:20:05,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:20:05,766 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2022-12-13 22:20:05,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 22:20:05,766 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-12-13 22:20:05,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:20:05,766 INFO L225 Difference]: With dead ends: 57 [2022-12-13 22:20:05,766 INFO L226 Difference]: Without dead ends: 55 [2022-12-13 22:20:05,767 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-12-13 22:20:05,767 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 41 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 22:20:05,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 77 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 22:20:05,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-12-13 22:20:05,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2022-12-13 22:20:05,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 53 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-12-13 22:20:05,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2022-12-13 22:20:05,771 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 13 [2022-12-13 22:20:05,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:20:05,771 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2022-12-13 22:20:05,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:20:05,771 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2022-12-13 22:20:05,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-13 22:20:05,772 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:20:05,772 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:20:05,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 22:20:05,772 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-12-13 22:20:05,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:20:05,772 INFO L85 PathProgramCache]: Analyzing trace with hash 313330138, now seen corresponding path program 1 times [2022-12-13 22:20:05,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:20:05,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907022796] [2022-12-13 22:20:05,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:20:05,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:20:05,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:20:05,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:20:05,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:20:05,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907022796] [2022-12-13 22:20:05,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907022796] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:20:05,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:20:05,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 22:20:05,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149309529] [2022-12-13 22:20:05,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:20:05,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 22:20:05,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:20:05,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 22:20:05,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 22:20:05,856 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:20:05,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:20:05,947 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2022-12-13 22:20:05,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 22:20:05,947 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-12-13 22:20:05,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:20:05,949 INFO L225 Difference]: With dead ends: 92 [2022-12-13 22:20:05,949 INFO L226 Difference]: Without dead ends: 90 [2022-12-13 22:20:05,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 22:20:05,950 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 49 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 22:20:05,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 164 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 22:20:05,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-12-13 22:20:05,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 60. [2022-12-13 22:20:05,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 59 states have internal predecessors, (67), 0 states have call successors, (0), 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-12-13 22:20:05,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2022-12-13 22:20:05,958 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 14 [2022-12-13 22:20:05,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:20:05,958 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2022-12-13 22:20:05,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:20:05,959 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2022-12-13 22:20:05,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-13 22:20:05,959 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:20:05,959 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:20:05,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 22:20:05,959 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-12-13 22:20:05,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:20:05,960 INFO L85 PathProgramCache]: Analyzing trace with hash 314877283, now seen corresponding path program 1 times [2022-12-13 22:20:05,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:20:05,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115136850] [2022-12-13 22:20:05,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:20:05,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:20:05,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:20:05,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:20:05,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:20:05,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115136850] [2022-12-13 22:20:05,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115136850] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:20:05,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:20:05,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 22:20:05,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727311696] [2022-12-13 22:20:05,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:20:05,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 22:20:05,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:20:05,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 22:20:05,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 22:20:05,993 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:20:06,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:20:06,054 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2022-12-13 22:20:06,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 22:20:06,054 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-12-13 22:20:06,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:20:06,055 INFO L225 Difference]: With dead ends: 80 [2022-12-13 22:20:06,055 INFO L226 Difference]: Without dead ends: 78 [2022-12-13 22:20:06,055 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-12-13 22:20:06,055 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 60 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 22:20:06,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 95 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 22:20:06,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-12-13 22:20:06,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 58. [2022-12-13 22:20:06,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 51 states have (on average 1.2745098039215685) internal successors, (65), 57 states have internal predecessors, (65), 0 states have call successors, (0), 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-12-13 22:20:06,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2022-12-13 22:20:06,060 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 14 [2022-12-13 22:20:06,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:20:06,060 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2022-12-13 22:20:06,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:20:06,061 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2022-12-13 22:20:06,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-13 22:20:06,061 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:20:06,061 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:20:06,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 22:20:06,061 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-12-13 22:20:06,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:20:06,062 INFO L85 PathProgramCache]: Analyzing trace with hash 366771218, now seen corresponding path program 1 times [2022-12-13 22:20:06,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:20:06,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683844512] [2022-12-13 22:20:06,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:20:06,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:20:06,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:20:06,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:20:06,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:20:06,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683844512] [2022-12-13 22:20:06,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683844512] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:20:06,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:20:06,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 22:20:06,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565860178] [2022-12-13 22:20:06,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:20:06,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 22:20:06,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:20:06,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 22:20:06,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 22:20:06,159 INFO L87 Difference]: Start difference. First operand 58 states and 65 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:20:06,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:20:06,228 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2022-12-13 22:20:06,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 22:20:06,228 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-12-13 22:20:06,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:20:06,229 INFO L225 Difference]: With dead ends: 70 [2022-12-13 22:20:06,229 INFO L226 Difference]: Without dead ends: 66 [2022-12-13 22:20:06,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 22:20:06,230 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 20 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 22:20:06,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 117 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 22:20:06,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-12-13 22:20:06,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 59. [2022-12-13 22:20:06,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 58 states have internal predecessors, (66), 0 states have call successors, (0), 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-12-13 22:20:06,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2022-12-13 22:20:06,236 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 14 [2022-12-13 22:20:06,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:20:06,237 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2022-12-13 22:20:06,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:20:06,237 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2022-12-13 22:20:06,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-13 22:20:06,237 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:20:06,237 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:20:06,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 22:20:06,237 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-12-13 22:20:06,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:20:06,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1171265312, now seen corresponding path program 1 times [2022-12-13 22:20:06,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:20:06,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535785797] [2022-12-13 22:20:06,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:20:06,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:20:06,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:20:06,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:20:06,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:20:06,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535785797] [2022-12-13 22:20:06,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535785797] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:20:06,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:20:06,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 22:20:06,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940160663] [2022-12-13 22:20:06,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:20:06,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 22:20:06,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:20:06,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 22:20:06,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 22:20:06,326 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:20:06,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:20:06,410 INFO L93 Difference]: Finished difference Result 87 states and 96 transitions. [2022-12-13 22:20:06,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 22:20:06,410 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-12-13 22:20:06,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:20:06,411 INFO L225 Difference]: With dead ends: 87 [2022-12-13 22:20:06,411 INFO L226 Difference]: Without dead ends: 85 [2022-12-13 22:20:06,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 22:20:06,411 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 44 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 22:20:06,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 147 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 22:20:06,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-12-13 22:20:06,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 62. [2022-12-13 22:20:06,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 55 states have (on average 1.2545454545454546) internal successors, (69), 61 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-12-13 22:20:06,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2022-12-13 22:20:06,416 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 15 [2022-12-13 22:20:06,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:20:06,417 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2022-12-13 22:20:06,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:20:06,417 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2022-12-13 22:20:06,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-13 22:20:06,417 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:20:06,417 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:20:06,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 22:20:06,417 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-12-13 22:20:06,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:20:06,418 INFO L85 PathProgramCache]: Analyzing trace with hash 462679229, now seen corresponding path program 1 times [2022-12-13 22:20:06,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:20:06,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257858383] [2022-12-13 22:20:06,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:20:06,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:20:06,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:20:06,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:20:06,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:20:06,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257858383] [2022-12-13 22:20:06,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257858383] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:20:06,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:20:06,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 22:20:06,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589282046] [2022-12-13 22:20:06,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:20:06,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 22:20:06,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:20:06,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 22:20:06,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 22:20:06,453 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:20:06,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:20:06,478 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2022-12-13 22:20:06,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 22:20:06,478 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-13 22:20:06,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:20:06,479 INFO L225 Difference]: With dead ends: 62 [2022-12-13 22:20:06,479 INFO L226 Difference]: Without dead ends: 60 [2022-12-13 22:20:06,479 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-12-13 22:20:06,479 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 37 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 22:20:06,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 66 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 22:20:06,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-12-13 22:20:06,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-12-13 22:20:06,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 54 states have (on average 1.2407407407407407) internal successors, (67), 59 states have internal predecessors, (67), 0 states have call successors, (0), 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-12-13 22:20:06,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2022-12-13 22:20:06,484 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 16 [2022-12-13 22:20:06,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:20:06,484 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2022-12-13 22:20:06,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:20:06,485 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2022-12-13 22:20:06,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-13 22:20:06,485 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:20:06,485 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:20:06,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 22:20:06,485 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-12-13 22:20:06,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:20:06,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1458158324, now seen corresponding path program 1 times [2022-12-13 22:20:06,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:20:06,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074668587] [2022-12-13 22:20:06,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:20:06,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:20:06,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:20:06,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:20:06,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:20:06,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074668587] [2022-12-13 22:20:06,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074668587] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:20:06,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:20:06,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 22:20:06,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455406194] [2022-12-13 22:20:06,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:20:06,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 22:20:06,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:20:06,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 22:20:06,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 22:20:06,522 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:20:06,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:20:06,556 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2022-12-13 22:20:06,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 22:20:06,556 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-12-13 22:20:06,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:20:06,556 INFO L225 Difference]: With dead ends: 60 [2022-12-13 22:20:06,557 INFO L226 Difference]: Without dead ends: 56 [2022-12-13 22:20:06,557 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-12-13 22:20:06,557 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 8 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 22:20:06,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 90 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 22:20:06,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-12-13 22:20:06,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-12-13 22:20:06,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 55 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:20:06,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2022-12-13 22:20:06,562 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 17 [2022-12-13 22:20:06,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:20:06,562 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2022-12-13 22:20:06,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:20:06,562 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2022-12-13 22:20:06,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-13 22:20:06,563 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:20:06,563 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:20:06,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 22:20:06,563 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-12-13 22:20:06,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:20:06,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1747922500, now seen corresponding path program 1 times [2022-12-13 22:20:06,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:20:06,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010711537] [2022-12-13 22:20:06,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:20:06,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:20:06,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:20:06,635 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:20:06,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:20:06,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010711537] [2022-12-13 22:20:06,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010711537] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 22:20:06,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328635061] [2022-12-13 22:20:06,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:20:06,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:20:06,636 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a73d8a12-8786-4959-a7c5-8941c5c6f140/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:20:06,637 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a73d8a12-8786-4959-a7c5-8941c5c6f140/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 22:20:06,638 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a73d8a12-8786-4959-a7c5-8941c5c6f140/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 22:20:06,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:20:06,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-13 22:20:06,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:20:06,891 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:20:06,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 22:20:06,979 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 22:20:06,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328635061] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 22:20:06,979 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 22:20:06,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 8] total 17 [2022-12-13 22:20:06,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570062549] [2022-12-13 22:20:06,980 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 22:20:06,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 22:20:06,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:20:06,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 22:20:06,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-12-13 22:20:06,981 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 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-12-13 22:20:07,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:20:07,187 INFO L93 Difference]: Finished difference Result 121 states and 136 transitions. [2022-12-13 22:20:07,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 22:20:07,187 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 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 18 [2022-12-13 22:20:07,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:20:07,188 INFO L225 Difference]: With dead ends: 121 [2022-12-13 22:20:07,188 INFO L226 Difference]: Without dead ends: 119 [2022-12-13 22:20:07,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=352, Unknown=0, NotChecked=0, Total=506 [2022-12-13 22:20:07,189 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 222 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 22:20:07,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 118 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 22:20:07,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-12-13 22:20:07,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 52. [2022-12-13 22:20:07,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 51 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-12-13 22:20:07,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2022-12-13 22:20:07,199 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 18 [2022-12-13 22:20:07,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:20:07,200 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2022-12-13 22:20:07,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 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-12-13 22:20:07,200 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-12-13 22:20:07,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-13 22:20:07,200 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:20:07,201 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:20:07,206 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a73d8a12-8786-4959-a7c5-8941c5c6f140/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 22:20:07,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a73d8a12-8786-4959-a7c5-8941c5c6f140/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:20:07,401 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-12-13 22:20:07,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:20:07,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1748415044, now seen corresponding path program 1 times [2022-12-13 22:20:07,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:20:07,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591125041] [2022-12-13 22:20:07,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:20:07,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:20:07,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:20:07,487 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:20:07,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:20:07,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591125041] [2022-12-13 22:20:07,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591125041] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 22:20:07,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465663730] [2022-12-13 22:20:07,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:20:07,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:20:07,488 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a73d8a12-8786-4959-a7c5-8941c5c6f140/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 22:20:07,488 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a73d8a12-8786-4959-a7c5-8941c5c6f140/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 22:20:07,489 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a73d8a12-8786-4959-a7c5-8941c5c6f140/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 22:20:07,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:20:07,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-13 22:20:07,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 22:20:07,684 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:20:07,684 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 22:20:07,759 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 22:20:07,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1465663730] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 22:20:07,759 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 22:20:07,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 8] total 17 [2022-12-13 22:20:07,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071170614] [2022-12-13 22:20:07,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 22:20:07,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 22:20:07,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:20:07,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 22:20:07,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-12-13 22:20:07,760 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 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-12-13 22:20:07,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:20:07,981 INFO L93 Difference]: Finished difference Result 100 states and 113 transitions. [2022-12-13 22:20:07,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 22:20:07,981 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 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 18 [2022-12-13 22:20:07,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:20:07,982 INFO L225 Difference]: With dead ends: 100 [2022-12-13 22:20:07,982 INFO L226 Difference]: Without dead ends: 98 [2022-12-13 22:20:07,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=352, Unknown=0, NotChecked=0, Total=506 [2022-12-13 22:20:07,983 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 179 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 22:20:07,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 142 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 22:20:07,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-12-13 22:20:07,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 45. [2022-12-13 22:20:07,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 44 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:20:07,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2022-12-13 22:20:07,990 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 18 [2022-12-13 22:20:07,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:20:07,990 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2022-12-13 22:20:07,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 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-12-13 22:20:07,991 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-12-13 22:20:07,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-13 22:20:07,991 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:20:07,991 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 22:20:07,995 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a73d8a12-8786-4959-a7c5-8941c5c6f140/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 22:20:08,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a73d8a12-8786-4959-a7c5-8941c5c6f140/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 22:20:08,192 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-12-13 22:20:08,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:20:08,192 INFO L85 PathProgramCache]: Analyzing trace with hash -2026613132, now seen corresponding path program 1 times [2022-12-13 22:20:08,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:20:08,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242669509] [2022-12-13 22:20:08,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:20:08,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:20:08,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:20:08,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:20:08,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:20:08,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242669509] [2022-12-13 22:20:08,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242669509] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:20:08,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:20:08,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 22:20:08,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378729861] [2022-12-13 22:20:08,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:20:08,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 22:20:08,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:20:08,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 22:20:08,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 22:20:08,278 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:20:08,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:20:08,351 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2022-12-13 22:20:08,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 22:20:08,351 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-12-13 22:20:08,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:20:08,352 INFO L225 Difference]: With dead ends: 60 [2022-12-13 22:20:08,352 INFO L226 Difference]: Without dead ends: 58 [2022-12-13 22:20:08,352 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-12-13 22:20:08,353 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 93 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 22:20:08,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 39 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 22:20:08,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-12-13 22:20:08,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 40. [2022-12-13 22:20:08,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 39 states have internal predecessors, (46), 0 states have call successors, (0), 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-12-13 22:20:08,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2022-12-13 22:20:08,359 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 18 [2022-12-13 22:20:08,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:20:08,359 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2022-12-13 22:20:08,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 22:20:08,360 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2022-12-13 22:20:08,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-13 22:20:08,360 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:20:08,360 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-12-13 22:20:08,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 22:20:08,360 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-12-13 22:20:08,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:20:08,361 INFO L85 PathProgramCache]: Analyzing trace with hash -684716563, now seen corresponding path program 1 times [2022-12-13 22:20:08,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:20:08,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052838362] [2022-12-13 22:20:08,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:20:08,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:20:08,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:20:08,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:20:08,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:20:08,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052838362] [2022-12-13 22:20:08,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052838362] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:20:08,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:20:08,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 22:20:08,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041421407] [2022-12-13 22:20:08,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:20:08,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 22:20:08,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:20:08,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 22:20:08,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 22:20:08,443 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 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-12-13 22:20:08,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:20:08,500 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2022-12-13 22:20:08,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 22:20:08,500 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 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-12-13 22:20:08,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:20:08,501 INFO L225 Difference]: With dead ends: 52 [2022-12-13 22:20:08,501 INFO L226 Difference]: Without dead ends: 50 [2022-12-13 22:20:08,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-12-13 22:20:08,502 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 84 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 22:20:08,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 34 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 22:20:08,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-12-13 22:20:08,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2022-12-13 22:20:08,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 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-12-13 22:20:08,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2022-12-13 22:20:08,507 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 19 [2022-12-13 22:20:08,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:20:08,508 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2022-12-13 22:20:08,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 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-12-13 22:20:08,508 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2022-12-13 22:20:08,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-13 22:20:08,508 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 22:20:08,508 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-12-13 22:20:08,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 22:20:08,509 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-12-13 22:20:08,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 22:20:08,509 INFO L85 PathProgramCache]: Analyzing trace with hash -631275483, now seen corresponding path program 1 times [2022-12-13 22:20:08,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 22:20:08,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35764381] [2022-12-13 22:20:08,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 22:20:08,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 22:20:08,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 22:20:08,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 22:20:08,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 22:20:08,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35764381] [2022-12-13 22:20:08,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35764381] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 22:20:08,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 22:20:08,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 22:20:08,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992716883] [2022-12-13 22:20:08,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 22:20:08,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 22:20:08,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 22:20:08,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 22:20:08,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 22:20:08,586 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 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-12-13 22:20:08,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 22:20:08,629 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-12-13 22:20:08,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 22:20:08,629 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 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-12-13 22:20:08,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 22:20:08,630 INFO L225 Difference]: With dead ends: 35 [2022-12-13 22:20:08,630 INFO L226 Difference]: Without dead ends: 0 [2022-12-13 22:20:08,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-13 22:20:08,631 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 21 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 22:20:08,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 25 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 22:20:08,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-12-13 22:20:08,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-12-13 22:20:08,631 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-12-13 22:20:08,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-12-13 22:20:08,632 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2022-12-13 22:20:08,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 22:20:08,632 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-13 22:20:08,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 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-12-13 22:20:08,632 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-12-13 22:20:08,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-12-13 22:20:08,634 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (17 of 18 remaining) [2022-12-13 22:20:08,635 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (16 of 18 remaining) [2022-12-13 22:20:08,635 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (15 of 18 remaining) [2022-12-13 22:20:08,635 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (14 of 18 remaining) [2022-12-13 22:20:08,635 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (13 of 18 remaining) [2022-12-13 22:20:08,636 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (12 of 18 remaining) [2022-12-13 22:20:08,636 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (11 of 18 remaining) [2022-12-13 22:20:08,636 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (10 of 18 remaining) [2022-12-13 22:20:08,636 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (9 of 18 remaining) [2022-12-13 22:20:08,636 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (8 of 18 remaining) [2022-12-13 22:20:08,636 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (7 of 18 remaining) [2022-12-13 22:20:08,636 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (6 of 18 remaining) [2022-12-13 22:20:08,637 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (5 of 18 remaining) [2022-12-13 22:20:08,637 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (4 of 18 remaining) [2022-12-13 22:20:08,637 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (3 of 18 remaining) [2022-12-13 22:20:08,637 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (2 of 18 remaining) [2022-12-13 22:20:08,637 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION (1 of 18 remaining) [2022-12-13 22:20:08,637 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION (0 of 18 remaining) [2022-12-13 22:20:08,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-13 22:20:08,639 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-12-13 22:20:28,385 WARN L233 SmtUtils]: Spent 17.89s on a formula simplification. DAG size of input: 75 DAG size of output: 71 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-13 22:21:54,455 WARN L233 SmtUtils]: Spent 1.36m on a formula simplification. DAG size of input: 93 DAG size of output: 93 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-12-13 22:21:55,025 INFO L899 garLoopResultBuilder]: For program point L126(line 126) no Hoare annotation was computed. [2022-12-13 22:21:55,025 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 224) no Hoare annotation was computed. [2022-12-13 22:21:55,025 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 72) no Hoare annotation was computed. [2022-12-13 22:21:55,025 INFO L899 garLoopResultBuilder]: For program point L52(line 52) no Hoare annotation was computed. [2022-12-13 22:21:55,025 INFO L899 garLoopResultBuilder]: For program point L176(line 176) no Hoare annotation was computed. [2022-12-13 22:21:55,025 INFO L899 garLoopResultBuilder]: For program point L366(line 366) no Hoare annotation was computed. [2022-12-13 22:21:55,025 INFO L899 garLoopResultBuilder]: For program point L333(line 333) no Hoare annotation was computed. [2022-12-13 22:21:55,025 INFO L899 garLoopResultBuilder]: For program point L234(lines 234 242) no Hoare annotation was computed. [2022-12-13 22:21:55,025 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 15 402) the Hoare annotation is: true [2022-12-13 22:21:55,026 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 297) no Hoare annotation was computed. [2022-12-13 22:21:55,026 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 126) no Hoare annotation was computed. [2022-12-13 22:21:55,026 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-12-13 22:21:55,026 INFO L895 garLoopResultBuilder]: At program point L284(lines 282 391) the Hoare annotation is: (and (not (<= |ULTIMATE.start_main_~main__tagbuf_len~0#1| |ULTIMATE.start_main_~main__t~0#1|)) (let ((.cse2 (<= 1 |ULTIMATE.start_main_~main__t~0#1|)) (.cse1 (= |ULTIMATE.start_main_~main__t~0#1| 0))) (let ((.cse0 (let ((.cse3 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~13#1| 0)))) (or (and .cse2 .cse3) (and .cse3 .cse1))))) (or (and .cse0 .cse1 (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~12#1| 1)) (and (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~18#1| 0)) (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~19#1| 1) .cse2 .cse0))))) [2022-12-13 22:21:55,026 INFO L899 garLoopResultBuilder]: For program point L152(lines 152 160) no Hoare annotation was computed. [2022-12-13 22:21:55,026 INFO L899 garLoopResultBuilder]: For program point L309(line 309) no Hoare annotation was computed. [2022-12-13 22:21:55,026 INFO L899 garLoopResultBuilder]: For program point L20(lines 20 401) no Hoare annotation was computed. [2022-12-13 22:21:55,026 INFO L899 garLoopResultBuilder]: For program point L276(lines 276 391) no Hoare annotation was computed. [2022-12-13 22:21:55,026 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 345) no Hoare annotation was computed. [2022-12-13 22:21:55,026 INFO L899 garLoopResultBuilder]: For program point L70(lines 70 94) no Hoare annotation was computed. [2022-12-13 22:21:55,026 INFO L899 garLoopResultBuilder]: For program point L186(lines 186 196) no Hoare annotation was computed. [2022-12-13 22:21:55,026 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 278) no Hoare annotation was computed. [2022-12-13 22:21:55,027 INFO L899 garLoopResultBuilder]: For program point L376(lines 376 385) no Hoare annotation was computed. [2022-12-13 22:21:55,027 INFO L899 garLoopResultBuilder]: For program point L343(lines 343 352) no Hoare annotation was computed. [2022-12-13 22:21:55,027 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 114) no Hoare annotation was computed. [2022-12-13 22:21:55,027 INFO L899 garLoopResultBuilder]: For program point L112(lines 112 203) no Hoare annotation was computed. [2022-12-13 22:21:55,027 INFO L899 garLoopResultBuilder]: For program point L236(line 236) no Hoare annotation was computed. [2022-12-13 22:21:55,027 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 333) no Hoare annotation was computed. [2022-12-13 22:21:55,027 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2022-12-13 22:21:55,027 INFO L895 garLoopResultBuilder]: At program point $Ultimate##12(lines 63 252) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~main__t~0#1|) (<= |ULTIMATE.start_main_~main__t~0#1| |ULTIMATE.start_main_~main__tagbuf_len~0#1|)) [2022-12-13 22:21:55,027 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 154) no Hoare annotation was computed. [2022-12-13 22:21:55,027 INFO L899 garLoopResultBuilder]: For program point L154(line 154) no Hoare annotation was computed. [2022-12-13 22:21:55,027 INFO L899 garLoopResultBuilder]: For program point L278(line 278) no Hoare annotation was computed. [2022-12-13 22:21:55,027 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION(line 378) no Hoare annotation was computed. [2022-12-13 22:21:55,027 INFO L899 garLoopResultBuilder]: For program point L105(lines 105 209) no Hoare annotation was computed. [2022-12-13 22:21:55,027 INFO L899 garLoopResultBuilder]: For program point L72(line 72) no Hoare annotation was computed. [2022-12-13 22:21:55,027 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 255) no Hoare annotation was computed. [2022-12-13 22:21:55,028 INFO L899 garLoopResultBuilder]: For program point L295(lines 295 317) no Hoare annotation was computed. [2022-12-13 22:21:55,028 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 142) no Hoare annotation was computed. [2022-12-13 22:21:55,028 INFO L899 garLoopResultBuilder]: For program point L188(line 188) no Hoare annotation was computed. [2022-12-13 22:21:55,028 INFO L899 garLoopResultBuilder]: For program point L378(line 378) no Hoare annotation was computed. [2022-12-13 22:21:55,028 INFO L902 garLoopResultBuilder]: At program point L89(lines 32 395) the Hoare annotation is: true [2022-12-13 22:21:55,028 INFO L899 garLoopResultBuilder]: For program point L345(line 345) no Hoare annotation was computed. [2022-12-13 22:21:55,028 INFO L899 garLoopResultBuilder]: For program point L114(line 114) no Hoare annotation was computed. [2022-12-13 22:21:55,028 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 366) no Hoare annotation was computed. [2022-12-13 22:21:55,028 INFO L899 garLoopResultBuilder]: For program point L32(lines 32 395) no Hoare annotation was computed. [2022-12-13 22:21:55,028 INFO L899 garLoopResultBuilder]: For program point L288(lines 288 390) no Hoare annotation was computed. [2022-12-13 22:21:55,028 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-12-13 22:21:55,028 INFO L899 garLoopResultBuilder]: For program point L222(lines 222 244) no Hoare annotation was computed. [2022-12-13 22:21:55,028 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 188) no Hoare annotation was computed. [2022-12-13 22:21:55,028 INFO L899 garLoopResultBuilder]: For program point L24(lines 24 396) no Hoare annotation was computed. [2022-12-13 22:21:55,028 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 52) no Hoare annotation was computed. [2022-12-13 22:21:55,028 INFO L899 garLoopResultBuilder]: For program point L82(lines 82 92) no Hoare annotation was computed. [2022-12-13 22:21:55,028 INFO L899 garLoopResultBuilder]: For program point L140(lines 140 162) no Hoare annotation was computed. [2022-12-13 22:21:55,028 INFO L899 garLoopResultBuilder]: For program point L297(line 297) no Hoare annotation was computed. [2022-12-13 22:21:55,029 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-12-13 22:21:55,029 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 176) no Hoare annotation was computed. [2022-12-13 22:21:55,029 INFO L899 garLoopResultBuilder]: For program point L124(lines 124 201) no Hoare annotation was computed. [2022-12-13 22:21:55,029 INFO L895 garLoopResultBuilder]: At program point L58(lines 32 395) the Hoare annotation is: (let ((.cse5 (<= |ULTIMATE.start_main_~main__t~0#1| 1)) (.cse0 (= |ULTIMATE.start_main_~main__t~0#1| 0)) (.cse2 (<= 1 |ULTIMATE.start_main_~main__t~0#1|))) (let ((.cse3 (let ((.cse6 (or .cse0 (and .cse2 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~13#1| 0)) (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~16#1| 0)))))) (or (and .cse5 .cse6) (and (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~19#1| 0)) .cse6)))) (.cse4 (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~17#1| 1)) (.cse1 (< |ULTIMATE.start_main_~main__t~0#1| |ULTIMATE.start_main_~main__tagbuf_len~0#1|))) (or (and .cse0 .cse1) (and (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~19#1| 1) .cse2 .cse3 .cse4 .cse1) (and .cse2 .cse3 .cse4 .cse5 .cse1)))) [2022-12-13 22:21:55,029 INFO L899 garLoopResultBuilder]: For program point L215(lines 215 250) no Hoare annotation was computed. [2022-12-13 22:21:55,029 INFO L899 garLoopResultBuilder]: For program point L50(lines 50 253) no Hoare annotation was computed. [2022-12-13 22:21:55,029 INFO L899 garLoopResultBuilder]: For program point L174(lines 174 198) no Hoare annotation was computed. [2022-12-13 22:21:55,029 INFO L899 garLoopResultBuilder]: For program point L364(lines 364 387) no Hoare annotation was computed. [2022-12-13 22:21:55,029 INFO L899 garLoopResultBuilder]: For program point L331(lines 331 354) no Hoare annotation was computed. [2022-12-13 22:21:55,029 INFO L899 garLoopResultBuilder]: For program point L265(lines 265 393) no Hoare annotation was computed. [2022-12-13 22:21:55,029 INFO L899 garLoopResultBuilder]: For program point L133(lines 133 200) no Hoare annotation was computed. [2022-12-13 22:21:55,029 INFO L899 garLoopResultBuilder]: For program point L224(line 224) no Hoare annotation was computed. [2022-12-13 22:21:55,029 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 236) no Hoare annotation was computed. [2022-12-13 22:21:55,029 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 84) no Hoare annotation was computed. [2022-12-13 22:21:55,029 INFO L899 garLoopResultBuilder]: For program point L84(line 84) no Hoare annotation was computed. [2022-12-13 22:21:55,029 INFO L899 garLoopResultBuilder]: For program point L307(lines 307 315) no Hoare annotation was computed. [2022-12-13 22:21:55,030 INFO L899 garLoopResultBuilder]: For program point L142(line 142) no Hoare annotation was computed. [2022-12-13 22:21:55,030 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 309) no Hoare annotation was computed. [2022-12-13 22:21:55,030 INFO L895 garLoopResultBuilder]: At program point L167(lines 101 251) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~main__t~0#1|) (not (<= |ULTIMATE.start_main_~main__tagbuf_len~0#1| |ULTIMATE.start_main_~main__t~0#1|))) [2022-12-13 22:21:55,030 INFO L899 garLoopResultBuilder]: For program point L101(lines 101 251) no Hoare annotation was computed. [2022-12-13 22:21:55,030 INFO L899 garLoopResultBuilder]: For program point L324(lines 324 389) no Hoare annotation was computed. [2022-12-13 22:21:55,032 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-12-13 22:21:55,034 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 22:21:55,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 10:21:55 BoogieIcfgContainer [2022-12-13 22:21:55,044 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 22:21:55,044 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 22:21:55,045 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 22:21:55,045 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 22:21:55,045 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:20:03" (3/4) ... [2022-12-13 22:21:55,047 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-12-13 22:21:55,055 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-12-13 22:21:55,055 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-12-13 22:21:55,056 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-12-13 22:21:55,056 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-13 22:21:55,086 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a73d8a12-8786-4959-a7c5-8941c5c6f140/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 22:21:55,087 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 22:21:55,087 INFO L158 Benchmark]: Toolchain (without parser) took 111967.00ms. Allocated memory was 109.1MB in the beginning and 604.0MB in the end (delta: 494.9MB). Free memory was 60.6MB in the beginning and 342.8MB in the end (delta: -282.1MB). Peak memory consumption was 213.4MB. Max. memory is 16.1GB. [2022-12-13 22:21:55,087 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 109.1MB. Free memory is still 79.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 22:21:55,087 INFO L158 Benchmark]: CACSL2BoogieTranslator took 305.49ms. Allocated memory was 109.1MB in the beginning and 165.7MB in the end (delta: 56.6MB). Free memory was 60.6MB in the beginning and 138.0MB in the end (delta: -77.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-12-13 22:21:55,088 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.13ms. Allocated memory is still 165.7MB. Free memory was 138.0MB in the beginning and 135.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 22:21:55,088 INFO L158 Benchmark]: Boogie Preprocessor took 25.42ms. Allocated memory is still 165.7MB. Free memory was 135.9MB in the beginning and 134.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 22:21:55,088 INFO L158 Benchmark]: RCFGBuilder took 337.51ms. Allocated memory is still 165.7MB. Free memory was 134.6MB in the beginning and 118.3MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-13 22:21:55,088 INFO L158 Benchmark]: TraceAbstraction took 111217.48ms. Allocated memory was 165.7MB in the beginning and 604.0MB in the end (delta: 438.3MB). Free memory was 118.3MB in the beginning and 348.0MB in the end (delta: -229.7MB). Peak memory consumption was 345.5MB. Max. memory is 16.1GB. [2022-12-13 22:21:55,088 INFO L158 Benchmark]: Witness Printer took 42.18ms. Allocated memory is still 604.0MB. Free memory was 346.9MB in the beginning and 342.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 22:21:55,089 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.16ms. Allocated memory is still 109.1MB. Free memory is still 79.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 305.49ms. Allocated memory was 109.1MB in the beginning and 165.7MB in the end (delta: 56.6MB). Free memory was 60.6MB in the beginning and 138.0MB in the end (delta: -77.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.13ms. Allocated memory is still 165.7MB. Free memory was 138.0MB in the beginning and 135.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.42ms. Allocated memory is still 165.7MB. Free memory was 135.9MB in the beginning and 134.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 337.51ms. Allocated memory is still 165.7MB. Free memory was 134.6MB in the beginning and 118.3MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 111217.48ms. Allocated memory was 165.7MB in the beginning and 604.0MB in the end (delta: 438.3MB). Free memory was 118.3MB in the beginning and 348.0MB in the end (delta: -229.7MB). Peak memory consumption was 345.5MB. Max. memory is 16.1GB. * Witness Printer took 42.18ms. Allocated memory is still 604.0MB. Free memory was 346.9MB in the beginning and 342.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. 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: 52]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 72]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 84]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 114]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 126]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 142]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 154]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 176]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 188]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 224]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 236]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 278]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 297]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 309]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 333]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 345]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 366]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 378]: 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, 75 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 111.2s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 106.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1536 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1536 mSDsluCounter, 2824 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1796 mSDsCounter, 139 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2139 IncrementalHoareTripleChecker+Invalid, 2278 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 139 mSolverCounterUnsat, 1028 mSDtfsCounter, 2139 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 233 GetRequests, 96 SyntacticMatches, 4 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=0, InterpolantAutomatonStates: 144, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 531 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 12 NumberOfFragments, 193 HoareAnnotationTreeSize, 6 FomulaSimplifications, 1951226 FormulaSimplificationTreeSizeReduction, 105.8s HoareSimplificationTime, 6 FomulaSimplificationsInter, 11241783 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 356 NumberOfCodeBlocks, 356 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 365 ConstructedInterpolants, 0 QuantifiedInterpolants, 1663 SizeOfPredicates, 12 NumberOfNonLiveVariables, 217 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 27 InterpolantComputations, 21 PerfectInterpolantSequences, 8/24 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: 15]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 63]: Loop Invariant Derived loop invariant: 1 <= main__t && main__t <= main__tagbuf_len - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 282]: Loop Invariant Derived loop invariant: !(main__tagbuf_len <= main__t) && (((((1 <= main__t && !(__VERIFIER_assert__cond == 0)) || (!(__VERIFIER_assert__cond == 0) && main__t == 0)) && main__t == 0) && __VERIFIER_assert__cond == 1) || (((!(__VERIFIER_assert__cond == 0) && __VERIFIER_assert__cond == 1) && 1 <= main__t) && ((1 <= main__t && !(__VERIFIER_assert__cond == 0)) || (!(__VERIFIER_assert__cond == 0) && main__t == 0)))) - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: 1 <= main__t && !(main__tagbuf_len <= main__t) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: ((main__t == 0 && main__t < main__tagbuf_len) || ((((__VERIFIER_assert__cond == 1 && 1 <= main__t) && ((main__t <= 1 && (main__t == 0 || ((1 <= main__t && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)))) || (!(__VERIFIER_assert__cond == 0) && (main__t == 0 || ((1 <= main__t && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)))))) && __VERIFIER_assert__cond == 1) && main__t < main__tagbuf_len)) || ((((1 <= main__t && ((main__t <= 1 && (main__t == 0 || ((1 <= main__t && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)))) || (!(__VERIFIER_assert__cond == 0) && (main__t == 0 || ((1 <= main__t && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)))))) && __VERIFIER_assert__cond == 1) && main__t <= 1) && main__t < main__tagbuf_len) RESULT: Ultimate proved your program to be correct! [2022-12-13 22:21:55,103 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a73d8a12-8786-4959-a7c5-8941c5c6f140/bin/uautomizer-uyxdKDjOR8/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