/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-4f750a8 [2020-12-22 04:28:45,064 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-22 04:28:45,066 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-22 04:28:45,108 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-22 04:28:45,109 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-22 04:28:45,110 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-22 04:28:45,112 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-22 04:28:45,114 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-22 04:28:45,116 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-22 04:28:45,117 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-22 04:28:45,119 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-22 04:28:45,120 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-22 04:28:45,121 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-22 04:28:45,122 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-22 04:28:45,123 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-22 04:28:45,125 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-22 04:28:45,126 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-22 04:28:45,127 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-22 04:28:45,129 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-22 04:28:45,132 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-22 04:28:45,134 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-22 04:28:45,136 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-22 04:28:45,138 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-22 04:28:45,139 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-22 04:28:45,143 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-22 04:28:45,143 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-22 04:28:45,144 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-22 04:28:45,145 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-22 04:28:45,145 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-22 04:28:45,146 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-22 04:28:45,147 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-22 04:28:45,147 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-22 04:28:45,162 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-22 04:28:45,163 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-22 04:28:45,164 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-22 04:28:45,165 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-22 04:28:45,166 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-22 04:28:45,166 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-22 04:28:45,166 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-22 04:28:45,167 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-22 04:28:45,168 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-22 04:28:45,169 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-22 04:28:45,195 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-22 04:28:45,195 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-22 04:28:45,197 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-22 04:28:45,197 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-22 04:28:45,197 INFO L138 SettingsManager]: * Use SBE=true [2020-12-22 04:28:45,197 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-22 04:28:45,197 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-22 04:28:45,198 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-22 04:28:45,198 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-22 04:28:45,198 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-22 04:28:45,198 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-22 04:28:45,198 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-22 04:28:45,199 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-22 04:28:45,199 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-22 04:28:45,199 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-22 04:28:45,199 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-22 04:28:45,199 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-22 04:28:45,200 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-22 04:28:45,200 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-22 04:28:45,200 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-22 04:28:45,200 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-22 04:28:45,200 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-22 04:28:45,201 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-22 04:28:45,201 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-22 04:28:45,201 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-22 04:28:45,201 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-12-22 04:28:45,563 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-22 04:28:45,590 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-22 04:28:45,593 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-22 04:28:45,594 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-22 04:28:45,595 INFO L275 PluginConnector]: CDTParser initialized [2020-12-22 04:28:45,596 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2020-12-22 04:28:45,685 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1e823a3e/0f94fc429dd64f8392574ff5874fb4b5/FLAG8edb60d3a [2020-12-22 04:28:46,447 INFO L306 CDTParser]: Found 1 translation units. [2020-12-22 04:28:46,448 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2020-12-22 04:28:46,457 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1e823a3e/0f94fc429dd64f8392574ff5874fb4b5/FLAG8edb60d3a [2020-12-22 04:28:46,772 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1e823a3e/0f94fc429dd64f8392574ff5874fb4b5 [2020-12-22 04:28:46,779 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-22 04:28:46,781 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-22 04:28:46,783 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-22 04:28:46,783 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-22 04:28:46,790 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-22 04:28:46,791 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 04:28:46" (1/1) ... [2020-12-22 04:28:46,794 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b7563e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:28:46, skipping insertion in model container [2020-12-22 04:28:46,794 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 04:28:46" (1/1) ... [2020-12-22 04:28:46,803 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-22 04:28:46,858 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-22 04:28:47,029 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[1551,1564] [2020-12-22 04:28:47,034 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[1758,1771] [2020-12-22 04:28:47,037 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2095,2108] [2020-12-22 04:28:47,039 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2296,2309] [2020-12-22 04:28:47,042 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2701,2714] [2020-12-22 04:28:47,043 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2902,2915] [2020-12-22 04:28:47,046 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3228,3241] [2020-12-22 04:28:47,048 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3435,3448] [2020-12-22 04:28:47,052 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3914,3927] [2020-12-22 04:28:47,054 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4118,4131] [2020-12-22 04:28:47,057 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4426,4439] [2020-12-22 04:28:47,059 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4630,4643] [2020-12-22 04:28:47,063 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4995,5008] [2020-12-22 04:28:47,065 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5198,5211] [2020-12-22 04:28:47,067 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5412,5425] [2020-12-22 04:28:47,070 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5616,5629] [2020-12-22 04:28:47,073 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[6138,6151] [2020-12-22 04:28:47,075 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[6342,6355] [2020-12-22 04:28:47,082 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-22 04:28:47,101 INFO L203 MainTranslator]: Completed pre-run [2020-12-22 04:28:47,143 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[1551,1564] [2020-12-22 04:28:47,149 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[1758,1771] [2020-12-22 04:28:47,155 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2095,2108] [2020-12-22 04:28:47,161 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2296,2309] [2020-12-22 04:28:47,168 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2701,2714] [2020-12-22 04:28:47,170 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2902,2915] [2020-12-22 04:28:47,175 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3228,3241] [2020-12-22 04:28:47,179 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3435,3448] [2020-12-22 04:28:47,193 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3914,3927] [2020-12-22 04:28:47,195 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4118,4131] [2020-12-22 04:28:47,200 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4426,4439] [2020-12-22 04:28:47,208 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4630,4643] [2020-12-22 04:28:47,212 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4995,5008] [2020-12-22 04:28:47,218 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5198,5211] [2020-12-22 04:28:47,220 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5412,5425] [2020-12-22 04:28:47,222 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5616,5629] [2020-12-22 04:28:47,226 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[6138,6151] [2020-12-22 04:28:47,227 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[6342,6355] [2020-12-22 04:28:47,230 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-22 04:28:47,249 INFO L208 MainTranslator]: Completed translation [2020-12-22 04:28:47,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:28:47 WrapperNode [2020-12-22 04:28:47,249 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-22 04:28:47,251 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-22 04:28:47,251 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-22 04:28:47,251 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-22 04:28:47,262 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:28:47" (1/1) ... [2020-12-22 04:28:47,273 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:28:47" (1/1) ... [2020-12-22 04:28:47,305 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-22 04:28:47,306 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-22 04:28:47,306 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-22 04:28:47,306 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-22 04:28:47,319 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:28:47" (1/1) ... [2020-12-22 04:28:47,319 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:28:47" (1/1) ... [2020-12-22 04:28:47,322 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:28:47" (1/1) ... [2020-12-22 04:28:47,323 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:28:47" (1/1) ... [2020-12-22 04:28:47,328 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:28:47" (1/1) ... [2020-12-22 04:28:47,332 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:28:47" (1/1) ... [2020-12-22 04:28:47,335 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:28:47" (1/1) ... [2020-12-22 04:28:47,338 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-22 04:28:47,340 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-22 04:28:47,340 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-22 04:28:47,340 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-22 04:28:47,341 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:28:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-22 04:28:47,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-22 04:28:47,459 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-22 04:28:47,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-22 04:28:47,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-22 04:28:48,216 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-22 04:28:48,217 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2020-12-22 04:28:48,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 04:28:48 BoogieIcfgContainer [2020-12-22 04:28:48,219 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-22 04:28:48,220 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-22 04:28:48,221 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-22 04:28:48,224 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-22 04:28:48,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 04:28:46" (1/3) ... [2020-12-22 04:28:48,225 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1197958c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 04:28:48, skipping insertion in model container [2020-12-22 04:28:48,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:28:47" (2/3) ... [2020-12-22 04:28:48,226 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1197958c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 04:28:48, skipping insertion in model container [2020-12-22 04:28:48,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 04:28:48" (3/3) ... [2020-12-22 04:28:48,228 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i.v+cfa-reducer.c [2020-12-22 04:28:48,234 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-22 04:28:48,239 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2020-12-22 04:28:48,258 INFO L253 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2020-12-22 04:28:48,285 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-22 04:28:48,285 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-22 04:28:48,286 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-22 04:28:48,286 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-22 04:28:48,286 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-22 04:28:48,286 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-22 04:28:48,286 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-22 04:28:48,287 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-22 04:28:48,306 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2020-12-22 04:28:48,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-22 04:28:48,312 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 04:28:48,313 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 04:28:48,314 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 04:28:48,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 04:28:48,320 INFO L82 PathProgramCache]: Analyzing trace with hash -2034435078, now seen corresponding path program 1 times [2020-12-22 04:28:48,330 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 04:28:48,330 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777581514] [2020-12-22 04:28:48,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 04:28:48,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:28:48,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 04:28:48,563 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777581514] [2020-12-22 04:28:48,564 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 04:28:48,564 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 04:28:48,565 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942327319] [2020-12-22 04:28:48,570 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 04:28:48,570 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 04:28:48,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 04:28:48,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 04:28:48,592 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 3 states. [2020-12-22 04:28:48,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 04:28:48,651 INFO L93 Difference]: Finished difference Result 88 states and 123 transitions. [2020-12-22 04:28:48,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 04:28:48,653 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2020-12-22 04:28:48,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 04:28:48,663 INFO L225 Difference]: With dead ends: 88 [2020-12-22 04:28:48,663 INFO L226 Difference]: Without dead ends: 76 [2020-12-22 04:28:48,666 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 04:28:48,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-12-22 04:28:48,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2020-12-22 04:28:48,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-12-22 04:28:48,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2020-12-22 04:28:48,710 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 15 [2020-12-22 04:28:48,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 04:28:48,710 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2020-12-22 04:28:48,710 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 04:28:48,710 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2020-12-22 04:28:48,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-22 04:28:48,711 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 04:28:48,711 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 04:28:48,712 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-22 04:28:48,712 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 04:28:48,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 04:28:48,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1357026114, now seen corresponding path program 1 times [2020-12-22 04:28:48,713 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 04:28:48,713 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234297463] [2020-12-22 04:28:48,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 04:28:48,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:28:48,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 04:28:48,792 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234297463] [2020-12-22 04:28:48,793 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 04:28:48,793 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-22 04:28:48,793 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119815733] [2020-12-22 04:28:48,794 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-22 04:28:48,795 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 04:28:48,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-22 04:28:48,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-22 04:28:48,796 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 6 states. [2020-12-22 04:28:48,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 04:28:48,881 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2020-12-22 04:28:48,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-22 04:28:48,882 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-12-22 04:28:48,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 04:28:48,884 INFO L225 Difference]: With dead ends: 76 [2020-12-22 04:28:48,884 INFO L226 Difference]: Without dead ends: 74 [2020-12-22 04:28:48,885 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-22 04:28:48,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-12-22 04:28:48,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2020-12-22 04:28:48,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-12-22 04:28:48,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2020-12-22 04:28:48,896 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 16 [2020-12-22 04:28:48,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 04:28:48,897 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2020-12-22 04:28:48,897 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-22 04:28:48,897 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2020-12-22 04:28:48,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-22 04:28:48,898 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 04:28:48,898 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 04:28:48,898 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-22 04:28:48,899 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 04:28:48,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 04:28:48,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1567835227, now seen corresponding path program 1 times [2020-12-22 04:28:48,900 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 04:28:48,900 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756130246] [2020-12-22 04:28:48,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 04:28:48,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:28:48,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 04:28:48,984 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756130246] [2020-12-22 04:28:48,984 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 04:28:48,985 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 04:28:48,985 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129592514] [2020-12-22 04:28:48,989 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 04:28:48,990 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 04:28:48,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 04:28:48,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 04:28:48,991 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 4 states. [2020-12-22 04:28:49,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 04:28:49,132 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2020-12-22 04:28:49,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 04:28:49,135 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-12-22 04:28:49,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 04:28:49,137 INFO L225 Difference]: With dead ends: 97 [2020-12-22 04:28:49,137 INFO L226 Difference]: Without dead ends: 95 [2020-12-22 04:28:49,137 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 04:28:49,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-12-22 04:28:49,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 72. [2020-12-22 04:28:49,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-12-22 04:28:49,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2020-12-22 04:28:49,161 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 18 [2020-12-22 04:28:49,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 04:28:49,161 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2020-12-22 04:28:49,163 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 04:28:49,164 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2020-12-22 04:28:49,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-22 04:28:49,165 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 04:28:49,165 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 04:28:49,165 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-22 04:28:49,165 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 04:28:49,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 04:28:49,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1358247672, now seen corresponding path program 1 times [2020-12-22 04:28:49,167 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 04:28:49,167 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289956916] [2020-12-22 04:28:49,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 04:28:49,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:28:49,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 04:28:49,261 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289956916] [2020-12-22 04:28:49,261 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 04:28:49,262 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 04:28:49,262 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102764378] [2020-12-22 04:28:49,263 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 04:28:49,263 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 04:28:49,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 04:28:49,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-22 04:28:49,264 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand 5 states. [2020-12-22 04:28:49,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 04:28:49,339 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2020-12-22 04:28:49,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 04:28:49,339 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-12-22 04:28:49,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 04:28:49,341 INFO L225 Difference]: With dead ends: 72 [2020-12-22 04:28:49,341 INFO L226 Difference]: Without dead ends: 70 [2020-12-22 04:28:49,342 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-22 04:28:49,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-12-22 04:28:49,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-12-22 04:28:49,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-12-22 04:28:49,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2020-12-22 04:28:49,351 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 19 [2020-12-22 04:28:49,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 04:28:49,351 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2020-12-22 04:28:49,351 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 04:28:49,351 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2020-12-22 04:28:49,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-22 04:28:49,352 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 04:28:49,352 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 04:28:49,353 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-22 04:28:49,353 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 04:28:49,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 04:28:49,354 INFO L82 PathProgramCache]: Analyzing trace with hash -665385716, now seen corresponding path program 1 times [2020-12-22 04:28:49,354 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 04:28:49,354 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734759740] [2020-12-22 04:28:49,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 04:28:49,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:28:49,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 04:28:49,441 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734759740] [2020-12-22 04:28:49,442 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 04:28:49,442 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 04:28:49,442 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818952614] [2020-12-22 04:28:49,443 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 04:28:49,443 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 04:28:49,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 04:28:49,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-22 04:28:49,444 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 5 states. [2020-12-22 04:28:49,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 04:28:49,608 INFO L93 Difference]: Finished difference Result 137 states and 143 transitions. [2020-12-22 04:28:49,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-22 04:28:49,608 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2020-12-22 04:28:49,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 04:28:49,610 INFO L225 Difference]: With dead ends: 137 [2020-12-22 04:28:49,610 INFO L226 Difference]: Without dead ends: 135 [2020-12-22 04:28:49,611 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-22 04:28:49,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2020-12-22 04:28:49,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 73. [2020-12-22 04:28:49,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-12-22 04:28:49,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2020-12-22 04:28:49,620 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 22 [2020-12-22 04:28:49,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 04:28:49,621 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2020-12-22 04:28:49,621 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 04:28:49,621 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2020-12-22 04:28:49,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-22 04:28:49,622 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 04:28:49,622 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 04:28:49,623 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-22 04:28:49,623 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 04:28:49,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 04:28:49,624 INFO L82 PathProgramCache]: Analyzing trace with hash -661217951, now seen corresponding path program 1 times [2020-12-22 04:28:49,624 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 04:28:49,624 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158927180] [2020-12-22 04:28:49,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 04:28:49,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:28:49,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 04:28:49,683 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158927180] [2020-12-22 04:28:49,683 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 04:28:49,684 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 04:28:49,684 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799017142] [2020-12-22 04:28:49,684 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 04:28:49,685 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 04:28:49,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 04:28:49,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-22 04:28:49,686 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand 5 states. [2020-12-22 04:28:49,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 04:28:49,820 INFO L93 Difference]: Finished difference Result 104 states and 110 transitions. [2020-12-22 04:28:49,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-22 04:28:49,821 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2020-12-22 04:28:49,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 04:28:49,823 INFO L225 Difference]: With dead ends: 104 [2020-12-22 04:28:49,824 INFO L226 Difference]: Without dead ends: 102 [2020-12-22 04:28:49,828 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-22 04:28:49,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-12-22 04:28:49,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 75. [2020-12-22 04:28:49,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-12-22 04:28:49,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2020-12-22 04:28:49,851 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 22 [2020-12-22 04:28:49,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 04:28:49,851 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2020-12-22 04:28:49,851 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 04:28:49,851 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2020-12-22 04:28:49,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-22 04:28:49,852 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 04:28:49,852 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 04:28:49,853 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-22 04:28:49,854 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 04:28:49,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 04:28:49,855 INFO L82 PathProgramCache]: Analyzing trace with hash 847883539, now seen corresponding path program 1 times [2020-12-22 04:28:49,855 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 04:28:49,855 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771147905] [2020-12-22 04:28:49,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 04:28:49,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:28:49,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 04:28:49,959 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771147905] [2020-12-22 04:28:49,960 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 04:28:49,960 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 04:28:49,960 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556568448] [2020-12-22 04:28:49,960 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 04:28:49,961 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 04:28:49,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 04:28:49,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-22 04:28:49,963 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 5 states. [2020-12-22 04:28:50,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 04:28:50,089 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2020-12-22 04:28:50,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 04:28:50,089 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2020-12-22 04:28:50,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 04:28:50,091 INFO L225 Difference]: With dead ends: 117 [2020-12-22 04:28:50,091 INFO L226 Difference]: Without dead ends: 115 [2020-12-22 04:28:50,092 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-22 04:28:50,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2020-12-22 04:28:50,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 73. [2020-12-22 04:28:50,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-12-22 04:28:50,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2020-12-22 04:28:50,112 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 23 [2020-12-22 04:28:50,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 04:28:50,114 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2020-12-22 04:28:50,114 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 04:28:50,114 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2020-12-22 04:28:50,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-22 04:28:50,117 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 04:28:50,117 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 04:28:50,117 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-22 04:28:50,117 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 04:28:50,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 04:28:50,119 INFO L82 PathProgramCache]: Analyzing trace with hash 977084131, now seen corresponding path program 1 times [2020-12-22 04:28:50,119 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 04:28:50,120 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615463336] [2020-12-22 04:28:50,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 04:28:50,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:28:50,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 04:28:50,208 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615463336] [2020-12-22 04:28:50,208 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 04:28:50,208 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 04:28:50,208 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938610309] [2020-12-22 04:28:50,209 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 04:28:50,209 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 04:28:50,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 04:28:50,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-22 04:28:50,210 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand 5 states. [2020-12-22 04:28:50,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 04:28:50,296 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2020-12-22 04:28:50,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 04:28:50,297 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2020-12-22 04:28:50,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 04:28:50,298 INFO L225 Difference]: With dead ends: 73 [2020-12-22 04:28:50,298 INFO L226 Difference]: Without dead ends: 71 [2020-12-22 04:28:50,299 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-22 04:28:50,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-12-22 04:28:50,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2020-12-22 04:28:50,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-12-22 04:28:50,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2020-12-22 04:28:50,305 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 23 [2020-12-22 04:28:50,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 04:28:50,306 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2020-12-22 04:28:50,306 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 04:28:50,306 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2020-12-22 04:28:50,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-22 04:28:50,308 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 04:28:50,308 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 04:28:50,309 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-22 04:28:50,309 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 04:28:50,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 04:28:50,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1619855478, now seen corresponding path program 1 times [2020-12-22 04:28:50,310 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 04:28:50,311 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804361851] [2020-12-22 04:28:50,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 04:28:50,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:28:50,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 04:28:50,370 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804361851] [2020-12-22 04:28:50,371 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 04:28:50,371 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 04:28:50,371 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084949627] [2020-12-22 04:28:50,372 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 04:28:50,372 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 04:28:50,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 04:28:50,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 04:28:50,373 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand 3 states. [2020-12-22 04:28:50,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 04:28:50,409 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2020-12-22 04:28:50,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 04:28:50,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-12-22 04:28:50,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 04:28:50,415 INFO L225 Difference]: With dead ends: 111 [2020-12-22 04:28:50,415 INFO L226 Difference]: Without dead ends: 71 [2020-12-22 04:28:50,416 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 04:28:50,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-12-22 04:28:50,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2020-12-22 04:28:50,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-12-22 04:28:50,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2020-12-22 04:28:50,441 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 25 [2020-12-22 04:28:50,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 04:28:50,441 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2020-12-22 04:28:50,442 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 04:28:50,442 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2020-12-22 04:28:50,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-22 04:28:50,449 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 04:28:50,449 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 04:28:50,450 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-22 04:28:50,450 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 04:28:50,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 04:28:50,451 INFO L82 PathProgramCache]: Analyzing trace with hash 595608307, now seen corresponding path program 1 times [2020-12-22 04:28:50,451 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 04:28:50,451 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868683285] [2020-12-22 04:28:50,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 04:28:50,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:28:50,549 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-22 04:28:50,549 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868683285] [2020-12-22 04:28:50,549 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591326556] [2020-12-22 04:28:50,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 04:28:50,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:28:50,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-22 04:28:50,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 04:28:50,773 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-22 04:28:50,774 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 04:28:50,774 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-12-22 04:28:50,774 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817214425] [2020-12-22 04:28:50,774 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-22 04:28:50,775 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 04:28:50,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-22 04:28:50,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-22 04:28:50,776 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand 6 states. [2020-12-22 04:28:50,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 04:28:50,901 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2020-12-22 04:28:50,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-22 04:28:50,901 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-12-22 04:28:50,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 04:28:50,902 INFO L225 Difference]: With dead ends: 111 [2020-12-22 04:28:50,902 INFO L226 Difference]: Without dead ends: 109 [2020-12-22 04:28:50,903 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-12-22 04:28:50,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-12-22 04:28:50,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 68. [2020-12-22 04:28:50,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-12-22 04:28:50,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2020-12-22 04:28:50,908 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 26 [2020-12-22 04:28:50,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 04:28:50,908 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2020-12-22 04:28:50,908 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-22 04:28:50,909 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2020-12-22 04:28:50,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-22 04:28:50,909 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 04:28:50,909 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 04:28:51,123 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-12-22 04:28:51,124 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 04:28:51,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 04:28:51,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1780382557, now seen corresponding path program 1 times [2020-12-22 04:28:51,126 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 04:28:51,126 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556997942] [2020-12-22 04:28:51,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 04:28:51,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:28:51,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 04:28:51,189 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556997942] [2020-12-22 04:28:51,190 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 04:28:51,190 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 04:28:51,190 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444065141] [2020-12-22 04:28:51,192 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 04:28:51,192 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 04:28:51,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 04:28:51,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-22 04:28:51,193 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 5 states. [2020-12-22 04:28:51,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 04:28:51,279 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2020-12-22 04:28:51,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-22 04:28:51,279 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2020-12-22 04:28:51,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 04:28:51,284 INFO L225 Difference]: With dead ends: 69 [2020-12-22 04:28:51,284 INFO L226 Difference]: Without dead ends: 67 [2020-12-22 04:28:51,285 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-12-22 04:28:51,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-12-22 04:28:51,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2020-12-22 04:28:51,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-12-22 04:28:51,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2020-12-22 04:28:51,296 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 26 [2020-12-22 04:28:51,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 04:28:51,296 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2020-12-22 04:28:51,296 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 04:28:51,296 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2020-12-22 04:28:51,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-22 04:28:51,297 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 04:28:51,298 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 04:28:51,298 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-22 04:28:51,299 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 04:28:51,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 04:28:51,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1280139623, now seen corresponding path program 1 times [2020-12-22 04:28:51,300 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 04:28:51,300 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668749655] [2020-12-22 04:28:51,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 04:28:51,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:28:51,378 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-22 04:28:51,379 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668749655] [2020-12-22 04:28:51,379 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147833476] [2020-12-22 04:28:51,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 04:28:51,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:28:51,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 19 conjunts are in the unsatisfiable core [2020-12-22 04:28:51,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 04:28:51,625 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 04:28:51,626 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 04:28:51,626 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8] total 11 [2020-12-22 04:28:51,626 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542745579] [2020-12-22 04:28:51,627 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-22 04:28:51,627 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 04:28:51,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-22 04:28:51,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-12-22 04:28:51,628 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand 11 states. [2020-12-22 04:28:51,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 04:28:51,891 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2020-12-22 04:28:51,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-22 04:28:51,892 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2020-12-22 04:28:51,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 04:28:51,892 INFO L225 Difference]: With dead ends: 67 [2020-12-22 04:28:51,892 INFO L226 Difference]: Without dead ends: 65 [2020-12-22 04:28:51,893 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2020-12-22 04:28:51,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-12-22 04:28:51,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2020-12-22 04:28:51,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-12-22 04:28:51,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2020-12-22 04:28:51,897 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 27 [2020-12-22 04:28:51,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 04:28:51,897 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2020-12-22 04:28:51,897 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-22 04:28:51,897 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2020-12-22 04:28:51,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-22 04:28:51,898 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 04:28:51,898 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 04:28:52,112 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2020-12-22 04:28:52,114 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 04:28:52,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 04:28:52,115 INFO L82 PathProgramCache]: Analyzing trace with hash -642711428, now seen corresponding path program 1 times [2020-12-22 04:28:52,116 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 04:28:52,116 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926423045] [2020-12-22 04:28:52,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 04:28:52,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:28:52,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 04:28:52,158 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926423045] [2020-12-22 04:28:52,158 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 04:28:52,158 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 04:28:52,158 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410325037] [2020-12-22 04:28:52,158 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 04:28:52,159 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 04:28:52,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 04:28:52,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-22 04:28:52,160 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 5 states. [2020-12-22 04:28:52,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 04:28:52,223 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2020-12-22 04:28:52,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 04:28:52,224 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2020-12-22 04:28:52,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 04:28:52,224 INFO L225 Difference]: With dead ends: 60 [2020-12-22 04:28:52,225 INFO L226 Difference]: Without dead ends: 58 [2020-12-22 04:28:52,226 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-22 04:28:52,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-12-22 04:28:52,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2020-12-22 04:28:52,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-12-22 04:28:52,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2020-12-22 04:28:52,230 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 27 [2020-12-22 04:28:52,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 04:28:52,232 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2020-12-22 04:28:52,232 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 04:28:52,232 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2020-12-22 04:28:52,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-12-22 04:28:52,234 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 04:28:52,234 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 04:28:52,234 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-22 04:28:52,234 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 04:28:52,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 04:28:52,235 INFO L82 PathProgramCache]: Analyzing trace with hash -47880409, now seen corresponding path program 1 times [2020-12-22 04:28:52,235 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 04:28:52,235 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840815331] [2020-12-22 04:28:52,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 04:28:52,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:28:52,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 04:28:52,302 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840815331] [2020-12-22 04:28:52,302 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 04:28:52,302 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 04:28:52,304 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129452151] [2020-12-22 04:28:52,305 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 04:28:52,305 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 04:28:52,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 04:28:52,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-22 04:28:52,306 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 5 states. [2020-12-22 04:28:52,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 04:28:52,366 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2020-12-22 04:28:52,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-22 04:28:52,366 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2020-12-22 04:28:52,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 04:28:52,367 INFO L225 Difference]: With dead ends: 59 [2020-12-22 04:28:52,367 INFO L226 Difference]: Without dead ends: 57 [2020-12-22 04:28:52,368 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-12-22 04:28:52,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-12-22 04:28:52,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2020-12-22 04:28:52,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-12-22 04:28:52,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2020-12-22 04:28:52,371 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 30 [2020-12-22 04:28:52,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 04:28:52,371 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2020-12-22 04:28:52,371 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 04:28:52,372 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2020-12-22 04:28:52,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-12-22 04:28:52,372 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 04:28:52,372 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 04:28:52,372 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-22 04:28:52,373 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 04:28:52,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 04:28:52,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1484288504, now seen corresponding path program 1 times [2020-12-22 04:28:52,373 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 04:28:52,374 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403344061] [2020-12-22 04:28:52,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 04:28:52,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:28:52,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 04:28:52,425 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403344061] [2020-12-22 04:28:52,425 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 04:28:52,425 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-22 04:28:52,426 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028920135] [2020-12-22 04:28:52,426 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-22 04:28:52,426 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 04:28:52,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-22 04:28:52,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-22 04:28:52,427 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 6 states. [2020-12-22 04:28:52,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 04:28:52,531 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2020-12-22 04:28:52,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-22 04:28:52,532 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2020-12-22 04:28:52,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 04:28:52,533 INFO L225 Difference]: With dead ends: 67 [2020-12-22 04:28:52,533 INFO L226 Difference]: Without dead ends: 65 [2020-12-22 04:28:52,533 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-12-22 04:28:52,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-12-22 04:28:52,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 54. [2020-12-22 04:28:52,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-12-22 04:28:52,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2020-12-22 04:28:52,538 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 31 [2020-12-22 04:28:52,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 04:28:52,538 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2020-12-22 04:28:52,538 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-22 04:28:52,538 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2020-12-22 04:28:52,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-12-22 04:28:52,538 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 04:28:52,539 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 04:28:52,539 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-22 04:28:52,539 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 04:28:52,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 04:28:52,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1746453711, now seen corresponding path program 1 times [2020-12-22 04:28:52,540 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 04:28:52,540 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844216580] [2020-12-22 04:28:52,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 04:28:52,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:28:52,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 04:28:52,589 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844216580] [2020-12-22 04:28:52,590 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 04:28:52,590 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 04:28:52,590 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613484987] [2020-12-22 04:28:52,590 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 04:28:52,591 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 04:28:52,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 04:28:52,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-22 04:28:52,591 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand 5 states. [2020-12-22 04:28:52,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 04:28:52,713 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2020-12-22 04:28:52,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-22 04:28:52,714 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2020-12-22 04:28:52,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 04:28:52,715 INFO L225 Difference]: With dead ends: 87 [2020-12-22 04:28:52,715 INFO L226 Difference]: Without dead ends: 85 [2020-12-22 04:28:52,715 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-22 04:28:52,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-12-22 04:28:52,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 57. [2020-12-22 04:28:52,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-12-22 04:28:52,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2020-12-22 04:28:52,720 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 34 [2020-12-22 04:28:52,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 04:28:52,721 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2020-12-22 04:28:52,721 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 04:28:52,721 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2020-12-22 04:28:52,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-22 04:28:52,721 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 04:28:52,722 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 04:28:52,722 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-22 04:28:52,722 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 04:28:52,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 04:28:52,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1694514003, now seen corresponding path program 1 times [2020-12-22 04:28:52,723 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 04:28:52,723 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062518702] [2020-12-22 04:28:52,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 04:28:52,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:28:52,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 04:28:52,791 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062518702] [2020-12-22 04:28:52,791 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 04:28:52,792 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 04:28:52,792 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800236359] [2020-12-22 04:28:52,792 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 04:28:52,792 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 04:28:52,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 04:28:52,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-22 04:28:52,793 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 5 states. [2020-12-22 04:28:52,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 04:28:52,878 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2020-12-22 04:28:52,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 04:28:52,878 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2020-12-22 04:28:52,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 04:28:52,879 INFO L225 Difference]: With dead ends: 57 [2020-12-22 04:28:52,879 INFO L226 Difference]: Without dead ends: 55 [2020-12-22 04:28:52,880 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-22 04:28:52,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-12-22 04:28:52,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2020-12-22 04:28:52,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-12-22 04:28:52,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2020-12-22 04:28:52,884 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 35 [2020-12-22 04:28:52,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 04:28:52,884 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2020-12-22 04:28:52,884 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 04:28:52,884 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2020-12-22 04:28:52,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-12-22 04:28:52,885 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 04:28:52,885 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 04:28:52,885 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-22 04:28:52,885 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 04:28:52,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 04:28:52,886 INFO L82 PathProgramCache]: Analyzing trace with hash 635482230, now seen corresponding path program 1 times [2020-12-22 04:28:52,886 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 04:28:52,886 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794422913] [2020-12-22 04:28:52,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 04:28:52,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:28:52,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 04:28:52,925 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794422913] [2020-12-22 04:28:52,925 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 04:28:52,926 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 04:28:52,926 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291939991] [2020-12-22 04:28:52,926 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 04:28:52,926 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 04:28:52,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 04:28:52,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 04:28:52,927 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 4 states. [2020-12-22 04:28:52,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 04:28:52,957 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2020-12-22 04:28:52,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 04:28:52,957 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2020-12-22 04:28:52,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 04:28:52,959 INFO L225 Difference]: With dead ends: 66 [2020-12-22 04:28:52,960 INFO L226 Difference]: Without dead ends: 64 [2020-12-22 04:28:52,960 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 04:28:52,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-12-22 04:28:52,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 53. [2020-12-22 04:28:52,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-12-22 04:28:52,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2020-12-22 04:28:52,967 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 37 [2020-12-22 04:28:52,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 04:28:52,968 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2020-12-22 04:28:52,968 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 04:28:52,968 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2020-12-22 04:28:52,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-12-22 04:28:52,968 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 04:28:52,969 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 04:28:52,969 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-22 04:28:52,969 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 04:28:52,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 04:28:52,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1774883137, now seen corresponding path program 1 times [2020-12-22 04:28:52,970 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 04:28:52,970 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041797889] [2020-12-22 04:28:52,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 04:28:52,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:28:53,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 04:28:53,033 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041797889] [2020-12-22 04:28:53,034 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 04:28:53,034 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 04:28:53,037 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372996700] [2020-12-22 04:28:53,038 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 04:28:53,038 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 04:28:53,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 04:28:53,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-22 04:28:53,045 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 5 states. [2020-12-22 04:28:53,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 04:28:53,082 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2020-12-22 04:28:53,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 04:28:53,083 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2020-12-22 04:28:53,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 04:28:53,083 INFO L225 Difference]: With dead ends: 62 [2020-12-22 04:28:53,083 INFO L226 Difference]: Without dead ends: 60 [2020-12-22 04:28:53,084 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-22 04:28:53,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-12-22 04:28:53,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 51. [2020-12-22 04:28:53,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-12-22 04:28:53,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2020-12-22 04:28:53,088 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 38 [2020-12-22 04:28:53,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 04:28:53,088 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2020-12-22 04:28:53,089 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 04:28:53,089 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2020-12-22 04:28:53,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-12-22 04:28:53,089 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 04:28:53,089 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 04:28:53,089 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-22 04:28:53,090 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 04:28:53,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 04:28:53,090 INFO L82 PathProgramCache]: Analyzing trace with hash 813201821, now seen corresponding path program 1 times [2020-12-22 04:28:53,090 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 04:28:53,091 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091574781] [2020-12-22 04:28:53,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 04:28:53,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:28:53,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 04:28:53,139 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091574781] [2020-12-22 04:28:53,139 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 04:28:53,139 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 04:28:53,139 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442579154] [2020-12-22 04:28:53,140 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 04:28:53,140 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 04:28:53,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 04:28:53,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-22 04:28:53,141 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand 5 states. [2020-12-22 04:28:53,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 04:28:53,266 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2020-12-22 04:28:53,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-22 04:28:53,267 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2020-12-22 04:28:53,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 04:28:53,267 INFO L225 Difference]: With dead ends: 84 [2020-12-22 04:28:53,267 INFO L226 Difference]: Without dead ends: 82 [2020-12-22 04:28:53,268 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-22 04:28:53,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-12-22 04:28:53,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 56. [2020-12-22 04:28:53,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-12-22 04:28:53,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2020-12-22 04:28:53,273 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 39 [2020-12-22 04:28:53,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 04:28:53,273 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2020-12-22 04:28:53,273 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 04:28:53,273 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2020-12-22 04:28:53,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-12-22 04:28:53,274 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 04:28:53,274 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 04:28:53,274 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-22 04:28:53,274 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 04:28:53,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 04:28:53,275 INFO L82 PathProgramCache]: Analyzing trace with hash -560543098, now seen corresponding path program 1 times [2020-12-22 04:28:53,275 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 04:28:53,275 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841199421] [2020-12-22 04:28:53,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 04:28:53,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:28:53,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 04:28:53,342 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841199421] [2020-12-22 04:28:53,342 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 04:28:53,342 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 04:28:53,344 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919096379] [2020-12-22 04:28:53,344 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 04:28:53,344 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 04:28:53,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 04:28:53,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-22 04:28:53,345 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 5 states. [2020-12-22 04:28:53,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 04:28:53,448 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2020-12-22 04:28:53,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 04:28:53,448 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2020-12-22 04:28:53,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 04:28:53,449 INFO L225 Difference]: With dead ends: 69 [2020-12-22 04:28:53,449 INFO L226 Difference]: Without dead ends: 67 [2020-12-22 04:28:53,449 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-22 04:28:53,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-12-22 04:28:53,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 54. [2020-12-22 04:28:53,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-12-22 04:28:53,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2020-12-22 04:28:53,455 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 40 [2020-12-22 04:28:53,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 04:28:53,455 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2020-12-22 04:28:53,455 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 04:28:53,455 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2020-12-22 04:28:53,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-12-22 04:28:53,456 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 04:28:53,456 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 04:28:53,456 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-22 04:28:53,457 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 04:28:53,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 04:28:53,457 INFO L82 PathProgramCache]: Analyzing trace with hash 375780089, now seen corresponding path program 1 times [2020-12-22 04:28:53,457 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 04:28:53,457 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316939230] [2020-12-22 04:28:53,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 04:28:53,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:28:53,514 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 04:28:53,515 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316939230] [2020-12-22 04:28:53,515 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821139211] [2020-12-22 04:28:53,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 04:28:53,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:28:53,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 11 conjunts are in the unsatisfiable core [2020-12-22 04:28:53,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 04:28:53,683 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 04:28:53,684 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 04:28:53,684 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 7 [2020-12-22 04:28:53,684 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359453850] [2020-12-22 04:28:53,685 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-22 04:28:53,685 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 04:28:53,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-22 04:28:53,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-12-22 04:28:53,686 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 7 states. [2020-12-22 04:28:53,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 04:28:53,815 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2020-12-22 04:28:53,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-22 04:28:53,815 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2020-12-22 04:28:53,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 04:28:53,816 INFO L225 Difference]: With dead ends: 56 [2020-12-22 04:28:53,816 INFO L226 Difference]: Without dead ends: 54 [2020-12-22 04:28:53,816 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-12-22 04:28:53,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-12-22 04:28:53,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2020-12-22 04:28:53,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-12-22 04:28:53,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2020-12-22 04:28:53,821 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 40 [2020-12-22 04:28:53,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 04:28:53,821 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2020-12-22 04:28:53,821 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-22 04:28:53,822 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2020-12-22 04:28:53,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-12-22 04:28:53,822 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 04:28:53,822 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 04:28:54,036 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2020-12-22 04:28:54,037 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 04:28:54,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 04:28:54,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1394778411, now seen corresponding path program 1 times [2020-12-22 04:28:54,038 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 04:28:54,039 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671159697] [2020-12-22 04:28:54,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 04:28:54,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 04:28:54,087 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-22 04:28:54,088 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671159697] [2020-12-22 04:28:54,088 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 04:28:54,088 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 04:28:54,088 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102814551] [2020-12-22 04:28:54,089 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 04:28:54,089 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 04:28:54,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 04:28:54,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-22 04:28:54,090 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 5 states. [2020-12-22 04:28:54,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 04:28:54,222 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2020-12-22 04:28:54,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-22 04:28:54,223 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2020-12-22 04:28:54,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 04:28:54,223 INFO L225 Difference]: With dead ends: 71 [2020-12-22 04:28:54,223 INFO L226 Difference]: Without dead ends: 0 [2020-12-22 04:28:54,224 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-22 04:28:54,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-22 04:28:54,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-22 04:28:54,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-22 04:28:54,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-22 04:28:54,225 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2020-12-22 04:28:54,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 04:28:54,225 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-22 04:28:54,225 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 04:28:54,225 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-22 04:28:54,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-22 04:28:54,225 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-22 04:28:54,227 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-12-22 04:28:54,440 WARN L197 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 101 [2020-12-22 04:28:54,559 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2020-12-22 04:28:54,678 WARN L197 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 102 [2020-12-22 04:28:54,790 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 29 [2020-12-22 04:28:55,174 WARN L197 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 63 [2020-12-22 04:28:55,302 WARN L197 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 27 [2020-12-22 04:28:55,673 WARN L197 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 70 [2020-12-22 04:28:55,678 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 97) no Hoare annotation was computed. [2020-12-22 04:28:55,679 INFO L189 CegarLoopUtils]: For program point L85(line 85) no Hoare annotation was computed. [2020-12-22 04:28:55,679 INFO L189 CegarLoopUtils]: For program point L234(lines 234 338) no Hoare annotation was computed. [2020-12-22 04:28:55,679 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 272) no Hoare annotation was computed. [2020-12-22 04:28:55,679 INFO L189 CegarLoopUtils]: For program point L135(lines 135 397) no Hoare annotation was computed. [2020-12-22 04:28:55,679 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-12-22 04:28:55,679 INFO L189 CegarLoopUtils]: For program point L284(line 284) no Hoare annotation was computed. [2020-12-22 04:28:55,679 INFO L189 CegarLoopUtils]: For program point L53(lines 53 433) no Hoare annotation was computed. [2020-12-22 04:28:55,679 INFO L189 CegarLoopUtils]: For program point L384(lines 384 393) no Hoare annotation was computed. [2020-12-22 04:28:55,680 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 255) no Hoare annotation was computed. [2020-12-22 04:28:55,680 INFO L185 CegarLoopUtils]: At program point L401(lines 131 402) the Hoare annotation is: (and (< ULTIMATE.start_main_~main__cp~0 ULTIMATE.start_main_~main__urilen~0) (= ULTIMATE.start_main_~__VERIFIER_assert__cond~3 1) (let ((.cse0 (<= 1 ULTIMATE.start_main_~main__cp~0)) (.cse1 (< 0 ULTIMATE.start_main_~main__scheme~0)) (.cse2 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~0 0))) (.cse3 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~1 0)))) (or (and .cse0 (= ULTIMATE.start_main_~__VERIFIER_assert__cond~2 1) .cse1 .cse2 .cse3) (and .cse0 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~16 0)) .cse1 .cse2 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~2 0)) .cse3)))) [2020-12-22 04:28:55,680 INFO L189 CegarLoopUtils]: For program point L104(lines 104 411) no Hoare annotation was computed. [2020-12-22 04:28:55,680 INFO L189 CegarLoopUtils]: For program point L71(lines 71 416) no Hoare annotation was computed. [2020-12-22 04:28:55,680 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 177) no Hoare annotation was computed. [2020-12-22 04:28:55,681 INFO L189 CegarLoopUtils]: For program point L253(lines 253 329) no Hoare annotation was computed. [2020-12-22 04:28:55,681 INFO L189 CegarLoopUtils]: For program point L187(lines 187 355) no Hoare annotation was computed. [2020-12-22 04:28:55,681 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION(line 386) no Hoare annotation was computed. [2020-12-22 04:28:55,681 INFO L189 CegarLoopUtils]: For program point L270(lines 270 322) no Hoare annotation was computed. [2020-12-22 04:28:55,681 INFO L189 CegarLoopUtils]: For program point L204(lines 204 353) no Hoare annotation was computed. [2020-12-22 04:28:55,681 INFO L189 CegarLoopUtils]: For program point L386(line 386) no Hoare annotation was computed. [2020-12-22 04:28:55,681 INFO L189 CegarLoopUtils]: For program point L155(lines 155 360) no Hoare annotation was computed. [2020-12-22 04:28:55,681 INFO L189 CegarLoopUtils]: For program point L23(lines 23 438) no Hoare annotation was computed. [2020-12-22 04:28:55,681 INFO L189 CegarLoopUtils]: For program point L255(line 255) no Hoare annotation was computed. [2020-12-22 04:28:55,681 INFO L189 CegarLoopUtils]: For program point L189(line 189) no Hoare annotation was computed. [2020-12-22 04:28:55,682 INFO L189 CegarLoopUtils]: For program point L123(lines 123 403) no Hoare annotation was computed. [2020-12-22 04:28:55,682 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 214) no Hoare annotation was computed. [2020-12-22 04:28:55,682 INFO L189 CegarLoopUtils]: For program point L272(line 272) no Hoare annotation was computed. [2020-12-22 04:28:55,682 INFO L189 CegarLoopUtils]: For program point L41(lines 41 435) no Hoare annotation was computed. [2020-12-22 04:28:55,682 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-12-22 04:28:55,682 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 189) no Hoare annotation was computed. [2020-12-22 04:28:55,682 INFO L189 CegarLoopUtils]: For program point L157(line 157) no Hoare annotation was computed. [2020-12-22 04:28:55,682 INFO L189 CegarLoopUtils]: For program point L372(lines 372 395) no Hoare annotation was computed. [2020-12-22 04:28:55,682 INFO L189 CegarLoopUtils]: For program point L306(lines 306 316) no Hoare annotation was computed. [2020-12-22 04:28:55,682 INFO L189 CegarLoopUtils]: For program point L224(lines 224 344) no Hoare annotation was computed. [2020-12-22 04:28:55,683 INFO L189 CegarLoopUtils]: For program point L125(line 125) no Hoare annotation was computed. [2020-12-22 04:28:55,683 INFO L189 CegarLoopUtils]: For program point L59(lines 59 432) no Hoare annotation was computed. [2020-12-22 04:28:55,683 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 113) no Hoare annotation was computed. [2020-12-22 04:28:55,683 INFO L189 CegarLoopUtils]: For program point L241(lines 241 331) no Hoare annotation was computed. [2020-12-22 04:28:55,683 INFO L189 CegarLoopUtils]: For program point L175(lines 175 357) no Hoare annotation was computed. [2020-12-22 04:28:55,683 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 284) no Hoare annotation was computed. [2020-12-22 04:28:55,683 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 226) no Hoare annotation was computed. [2020-12-22 04:28:55,683 INFO L189 CegarLoopUtils]: For program point L374(line 374) no Hoare annotation was computed. [2020-12-22 04:28:55,683 INFO L189 CegarLoopUtils]: For program point L308(line 308) no Hoare annotation was computed. [2020-12-22 04:28:55,683 INFO L189 CegarLoopUtils]: For program point L143(lines 143 362) no Hoare annotation was computed. [2020-12-22 04:28:55,684 INFO L189 CegarLoopUtils]: For program point L226(line 226) no Hoare annotation was computed. [2020-12-22 04:28:55,684 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 145) no Hoare annotation was computed. [2020-12-22 04:28:55,684 INFO L189 CegarLoopUtils]: For program point L61(lines 61 427) no Hoare annotation was computed. [2020-12-22 04:28:55,684 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-12-22 04:28:55,684 INFO L189 CegarLoopUtils]: For program point L243(line 243) no Hoare annotation was computed. [2020-12-22 04:28:55,684 INFO L189 CegarLoopUtils]: For program point L177(line 177) no Hoare annotation was computed. [2020-12-22 04:28:55,684 INFO L189 CegarLoopUtils]: For program point L111(lines 111 405) no Hoare annotation was computed. [2020-12-22 04:28:55,684 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 308) no Hoare annotation was computed. [2020-12-22 04:28:55,685 INFO L185 CegarLoopUtils]: At program point L392(lines 129 403) the Hoare annotation is: (and (let ((.cse0 (<= 1 ULTIMATE.start_main_~main__cp~0)) (.cse1 (< 0 ULTIMATE.start_main_~main__scheme~0)) (.cse2 (= ULTIMATE.start_main_~__VERIFIER_assert__cond~3 1)) (.cse3 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~0 0))) (.cse4 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~1 0)))) (or (and .cse0 .cse1 .cse2 .cse3 (<= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~16) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~2 0)) .cse4 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~17 0))) (and .cse0 (= ULTIMATE.start_main_~__VERIFIER_assert__cond~2 1) .cse1 .cse2 .cse3 .cse4))) (< ULTIMATE.start_main_~main__cp~0 ULTIMATE.start_main_~main__urilen~0)) [2020-12-22 04:28:55,685 INFO L189 CegarLoopUtils]: For program point L194(lines 194 354) no Hoare annotation was computed. [2020-12-22 04:28:55,685 INFO L189 CegarLoopUtils]: For program point L95(lines 95 412) no Hoare annotation was computed. [2020-12-22 04:28:55,685 INFO L189 CegarLoopUtils]: For program point L29(lines 29 437) no Hoare annotation was computed. [2020-12-22 04:28:55,685 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 125) no Hoare annotation was computed. [2020-12-22 04:28:55,685 INFO L189 CegarLoopUtils]: For program point L145(line 145) no Hoare annotation was computed. [2020-12-22 04:28:55,685 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 296) no Hoare annotation was computed. [2020-12-22 04:28:55,686 INFO L185 CegarLoopUtils]: At program point L327(lines 262 328) the Hoare annotation is: (and (let ((.cse0 (let ((.cse1 (<= 1 ULTIMATE.start_main_~main__cp~0)) (.cse2 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~7 0))) (.cse3 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~6 0))) (.cse4 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~11 0))) (.cse5 (< 0 ULTIMATE.start_main_~main__scheme~0)) (.cse6 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~5 0))) (.cse7 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~2 0))) (.cse8 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~8 0))) (.cse9 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~0 0))) (.cse10 (= ULTIMATE.start_main_~__VERIFIER_assert__cond~3 1)) (.cse11 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~1 0))) (.cse12 (= ULTIMATE.start_main_~__VERIFIER_assert__cond~4 1))) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= (+ ULTIMATE.start_main_~main__c~0 2) ULTIMATE.start_main_~main__tokenlen~0) .cse9 .cse10 .cse11 .cse12) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~12 0)) .cse9 .cse10 .cse11 .cse12))))) (or (and (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~13 0)) (<= 1 ULTIMATE.start_main_~main__c~0) .cse0) (and .cse0 (= ULTIMATE.start_main_~main__c~0 0)))) (= ULTIMATE.start_main_~__VERIFIER_assert__cond~9 1) (< (+ ULTIMATE.start_main_~main__cp~0 1) ULTIMATE.start_main_~main__urilen~0) (= ULTIMATE.start_main_~__VERIFIER_assert__cond~10 1)) [2020-12-22 04:28:55,686 INFO L189 CegarLoopUtils]: For program point L294(lines 294 318) no Hoare annotation was computed. [2020-12-22 04:28:55,686 INFO L189 CegarLoopUtils]: For program point L162(lines 162 359) no Hoare annotation was computed. [2020-12-22 04:28:55,686 INFO L189 CegarLoopUtils]: For program point L63(lines 63 422) no Hoare annotation was computed. [2020-12-22 04:28:55,686 INFO L185 CegarLoopUtils]: At program point L410(lines 104 411) the Hoare annotation is: (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~0 0)) [2020-12-22 04:28:55,686 INFO L189 CegarLoopUtils]: For program point L212(lines 212 346) no Hoare annotation was computed. [2020-12-22 04:28:55,686 INFO L189 CegarLoopUtils]: For program point L113(line 113) no Hoare annotation was computed. [2020-12-22 04:28:55,686 INFO L189 CegarLoopUtils]: For program point L47(lines 47 434) no Hoare annotation was computed. [2020-12-22 04:28:55,687 INFO L189 CegarLoopUtils]: For program point L262(lines 262 328) no Hoare annotation was computed. [2020-12-22 04:28:55,687 INFO L189 CegarLoopUtils]: For program point L97(line 97) no Hoare annotation was computed. [2020-12-22 04:28:55,687 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 157) no Hoare annotation was computed. [2020-12-22 04:28:55,687 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 374) no Hoare annotation was computed. [2020-12-22 04:28:55,687 INFO L189 CegarLoopUtils]: For program point L296(line 296) no Hoare annotation was computed. [2020-12-22 04:28:55,687 INFO L189 CegarLoopUtils]: For program point L65(lines 65 417) no Hoare annotation was computed. [2020-12-22 04:28:55,687 INFO L189 CegarLoopUtils]: For program point L-1(line -1) no Hoare annotation was computed. [2020-12-22 04:28:55,687 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 85) no Hoare annotation was computed. [2020-12-22 04:28:55,687 INFO L189 CegarLoopUtils]: For program point L214(line 214) no Hoare annotation was computed. [2020-12-22 04:28:55,687 INFO L189 CegarLoopUtils]: For program point L83(lines 83 414) no Hoare annotation was computed. [2020-12-22 04:28:55,688 INFO L185 CegarLoopUtils]: At program point L315(lines 230 344) the Hoare annotation is: (let ((.cse2 (<= 1 ULTIMATE.start_main_~main__cp~0)) (.cse3 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~7 0))) (.cse4 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~6 0))) (.cse6 (< 0 ULTIMATE.start_main_~main__scheme~0)) (.cse7 (< ULTIMATE.start_main_~main__cp~0 ULTIMATE.start_main_~main__urilen~0)) (.cse8 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~5 0))) (.cse9 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~2 0))) (.cse10 (= ULTIMATE.start_main_~__VERIFIER_assert__cond~9 1)) (.cse12 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~8 0))) (.cse13 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~0 0))) (.cse14 (= ULTIMATE.start_main_~__VERIFIER_assert__cond~3 1)) (.cse15 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~1 0))) (.cse16 (= ULTIMATE.start_main_~__VERIFIER_assert__cond~4 1)) (.cse1 (= ULTIMATE.start_main_~main__c~0 0))) (or (and (<= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~10) (let ((.cse0 (let ((.cse5 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~11 0))) (.cse11 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~10 0)))) (or (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~12 0)) .cse13 .cse14 .cse15 .cse16) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= (+ ULTIMATE.start_main_~main__c~0 2) ULTIMATE.start_main_~main__tokenlen~0) .cse13 .cse14 .cse15 .cse16))))) (or (and (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~13 0)) (<= 1 ULTIMATE.start_main_~main__c~0) .cse0) (and .cse0 .cse1)))) (and .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 (= ULTIMATE.start_main_~__VERIFIER_assert__cond~8 1) .cse12 (= ULTIMATE.start_main_~__VERIFIER_assert__cond~6 1) .cse13 .cse14 .cse15 (< (+ ULTIMATE.start_main_~main__cp~0 1) ULTIMATE.start_main_~main__urilen~0) .cse16 .cse1))) [2020-12-22 04:28:55,688 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 243) no Hoare annotation was computed. [2020-12-22 04:28:55,688 INFO L189 CegarLoopUtils]: For program point L282(lines 282 320) no Hoare annotation was computed. [2020-12-22 04:28:55,688 INFO L192 CegarLoopUtils]: At program point L431(lines 13 439) the Hoare annotation is: true [2020-12-22 04:28:55,688 INFO L189 CegarLoopUtils]: For program point L35(lines 35 436) no Hoare annotation was computed. [2020-12-22 04:28:55,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 04:28:55 BoogieIcfgContainer [2020-12-22 04:28:55,744 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-22 04:28:55,745 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-22 04:28:55,745 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-22 04:28:55,745 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-22 04:28:55,746 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 04:28:48" (3/4) ... [2020-12-22 04:28:55,749 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-12-22 04:28:55,773 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2020-12-22 04:28:55,774 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-12-22 04:28:55,774 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-22 04:28:55,775 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-22 04:28:55,848 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c-witness.graphml [2020-12-22 04:28:55,848 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-22 04:28:55,849 INFO L168 Benchmark]: Toolchain (without parser) took 9067.65 ms. Allocated memory was 152.0 MB in the beginning and 241.2 MB in the end (delta: 89.1 MB). Free memory was 126.9 MB in the beginning and 178.9 MB in the end (delta: -52.0 MB). Peak memory consumption was 37.4 MB. Max. memory is 8.0 GB. [2020-12-22 04:28:55,849 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 152.0 MB. Free memory was 125.7 MB in the beginning and 125.3 MB in the end (delta: 419.4 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-12-22 04:28:55,850 INFO L168 Benchmark]: CACSL2BoogieTranslator took 466.73 ms. Allocated memory is still 152.0 MB. Free memory was 126.7 MB in the beginning and 107.0 MB in the end (delta: 19.7 MB). Peak memory consumption was 19.9 MB. Max. memory is 8.0 GB. [2020-12-22 04:28:55,850 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.16 ms. Allocated memory is still 152.0 MB. Free memory was 107.0 MB in the beginning and 104.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-12-22 04:28:55,850 INFO L168 Benchmark]: Boogie Preprocessor took 32.87 ms. Allocated memory is still 152.0 MB. Free memory was 104.9 MB in the beginning and 103.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-12-22 04:28:55,851 INFO L168 Benchmark]: RCFGBuilder took 879.26 ms. Allocated memory is still 152.0 MB. Free memory was 103.6 MB in the beginning and 125.5 MB in the end (delta: -21.9 MB). Peak memory consumption was 23.2 MB. Max. memory is 8.0 GB. [2020-12-22 04:28:55,851 INFO L168 Benchmark]: TraceAbstraction took 7524.16 ms. Allocated memory was 152.0 MB in the beginning and 241.2 MB in the end (delta: 89.1 MB). Free memory was 124.9 MB in the beginning and 186.2 MB in the end (delta: -61.3 MB). Peak memory consumption was 131.7 MB. Max. memory is 8.0 GB. [2020-12-22 04:28:55,852 INFO L168 Benchmark]: Witness Printer took 102.89 ms. Allocated memory is still 241.2 MB. Free memory was 185.7 MB in the beginning and 178.9 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.3 MB. Max. memory is 8.0 GB. [2020-12-22 04:28:55,854 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.22 ms. Allocated memory is still 152.0 MB. Free memory was 125.7 MB in the beginning and 125.3 MB in the end (delta: 419.4 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 466.73 ms. Allocated memory is still 152.0 MB. Free memory was 126.7 MB in the beginning and 107.0 MB in the end (delta: 19.7 MB). Peak memory consumption was 19.9 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 54.16 ms. Allocated memory is still 152.0 MB. Free memory was 107.0 MB in the beginning and 104.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 32.87 ms. Allocated memory is still 152.0 MB. Free memory was 104.9 MB in the beginning and 103.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 879.26 ms. Allocated memory is still 152.0 MB. Free memory was 103.6 MB in the beginning and 125.5 MB in the end (delta: -21.9 MB). Peak memory consumption was 23.2 MB. Max. memory is 8.0 GB. * TraceAbstraction took 7524.16 ms. Allocated memory was 152.0 MB in the beginning and 241.2 MB in the end (delta: 89.1 MB). Free memory was 124.9 MB in the beginning and 186.2 MB in the end (delta: -61.3 MB). Peak memory consumption was 131.7 MB. Max. memory is 8.0 GB. * Witness Printer took 102.89 ms. Allocated memory is still 241.2 MB. Free memory was 185.7 MB in the beginning and 178.9 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.3 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 97]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 214]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 189]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 374]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 308]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 386]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 125]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 85]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 113]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 272]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 145]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 157]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 177]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 243]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 296]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 284]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 255]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 226]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: ((((((((1 <= main__cp && 0 < main__scheme) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) || (((((1 <= main__cp && __VERIFIER_assert__cond == 1) && 0 < main__scheme) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0))) && main__cp < main__urilen - InvariantResult [Line: 262]: Loop Invariant Derived loop invariant: (((((!(__VERIFIER_assert__cond == 0) && 1 <= main__c) && (((((((((((((1 <= main__cp && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__c + 2 <= main__tokenlen) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) || ((((((((((((1 <= main__cp && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1))) || ((((((((((((((1 <= main__cp && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__c + 2 <= main__tokenlen) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) || ((((((((((((1 <= main__cp && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1)) && main__c == 0)) && __VERIFIER_assert__cond == 1) && main__cp + 1 < main__urilen) && __VERIFIER_assert__cond == 1 - InvariantResult [Line: 131]: Loop Invariant Derived loop invariant: (main__cp < main__urilen && __VERIFIER_assert__cond == 1) && (((((1 <= main__cp && __VERIFIER_assert__cond == 1) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) || (((((1 <= main__cp && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0))) - InvariantResult [Line: 230]: Loop Invariant Derived loop invariant: (1 <= __VERIFIER_assert__cond && (((!(__VERIFIER_assert__cond == 0) && 1 <= main__c) && ((((((((((((((((1 <= main__cp && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && main__cp < main__urilen) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) || (((((((((((((((1 <= main__cp && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && main__cp < main__urilen) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__c + 2 <= main__tokenlen) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1))) || (((((((((((((((((1 <= main__cp && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && main__cp < main__urilen) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) || (((((((((((((((1 <= main__cp && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && main__cp < main__urilen) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__c + 2 <= main__tokenlen) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1)) && main__c == 0))) || ((((((((((((((((1 <= main__cp && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && main__cp < main__urilen) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 < main__urilen) && __VERIFIER_assert__cond == 1) && main__c == 0) - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: !(__VERIFIER_assert__cond == 0) - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 82 locations, 18 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 5.9s, OverallIterations: 23, TraceHistogramMax: 2, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1245 SDtfs, 2415 SDslu, 1444 SDs, 0 SdLazy, 1187 SolverSat, 130 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 258 GetRequests, 128 SyntacticMatches, 7 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 302 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 15 NumberOfFragments, 653 HoareAnnotationTreeSize, 6 FomulaSimplifications, 421683 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 6 FomulaSimplificationsInter, 30537 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 751 NumberOfCodeBlocks, 751 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 725 ConstructedInterpolants, 0 QuantifiedInterpolants, 47843 SizeOfPredicates, 16 NumberOfNonLiveVariables, 398 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 26 InterpolantComputations, 20 PerfectInterpolantSequences, 8/21 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...