/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/bitvector/soft_float_4-3a.c.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 01:39:21,415 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 01:39:21,419 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 01:39:21,474 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 01:39:21,475 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 01:39:21,480 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 01:39:21,485 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 01:39:21,492 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 01:39:21,497 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 01:39:21,504 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 01:39:21,508 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 01:39:21,509 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 01:39:21,510 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 01:39:21,514 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 01:39:21,516 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 01:39:21,518 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 01:39:21,519 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 01:39:21,522 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 01:39:21,529 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 01:39:21,538 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 01:39:21,540 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 01:39:21,542 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 01:39:21,544 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 01:39:21,546 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 01:39:21,568 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 01:39:21,568 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 01:39:21,569 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 01:39:21,571 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 01:39:21,571 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 01:39:21,573 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 01:39:21,573 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 01:39:21,574 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 01:39:21,576 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 01:39:21,577 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 01:39:21,583 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 01:39:21,583 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 01:39:21,584 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 01:39:21,591 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 01:39:21,592 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 01:39:21,593 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 01:39:21,594 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 01:39:21,595 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 01:39:21,623 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 01:39:21,624 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 01:39:21,625 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 01:39:21,626 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 01:39:21,626 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 01:39:21,626 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 01:39:21,626 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 01:39:21,626 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 01:39:21,627 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 01:39:21,627 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 01:39:21,627 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 01:39:21,627 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 01:39:21,628 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 01:39:21,628 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 01:39:21,628 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 01:39:21,628 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 01:39:21,628 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 01:39:21,629 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 01:39:21,629 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 01:39:21,629 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 01:39:21,629 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 01:39:21,630 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 01:39:21,630 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 01:39:21,630 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 01:39:21,630 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 01:39:21,631 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-bitabs/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-23 01:39:22,022 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 01:39:22,070 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 01:39:22,074 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 01:39:22,075 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 01:39:22,076 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 01:39:22,077 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2020-12-23 01:39:22,164 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/02f79a6ca/faece333392b43f4b20fffb5f0f09542/FLAGd75c5dd3d [2020-12-23 01:39:22,890 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 01:39:22,890 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2020-12-23 01:39:22,904 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/02f79a6ca/faece333392b43f4b20fffb5f0f09542/FLAGd75c5dd3d [2020-12-23 01:39:23,219 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/02f79a6ca/faece333392b43f4b20fffb5f0f09542 [2020-12-23 01:39:23,225 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 01:39:23,231 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 01:39:23,235 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 01:39:23,236 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 01:39:23,240 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 01:39:23,242 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 01:39:23" (1/1) ... [2020-12-23 01:39:23,244 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f56d7c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:39:23, skipping insertion in model container [2020-12-23 01:39:23,245 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 01:39:23" (1/1) ... [2020-12-23 01:39:23,255 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 01:39:23,308 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-23 01:39:23,525 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c[425,438] left hand side expression in assignment: lhs: VariableLHS[~__retres4~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres4~0,] left hand side expression in assignment: lhs: VariableLHS[~e,] left hand side expression in assignment: lhs: VariableLHS[~m,] left hand side expression in assignment: lhs: VariableLHS[~__retres4~0,] left hand side expression in assignment: lhs: VariableLHS[~e,] left hand side expression in assignment: lhs: VariableLHS[~m,] left hand side expression in assignment: lhs: VariableLHS[~m,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~res~0,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~__retres4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~a,] left hand side expression in assignment: lhs: VariableLHS[~b,] left hand side expression in assignment: lhs: VariableLHS[~__retres10~0,] left hand side expression in assignment: lhs: VariableLHS[~ma~0,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~ea~0,] left hand side expression in assignment: lhs: VariableLHS[~ma~0,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~mb~0,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~eb~0,] left hand side expression in assignment: lhs: VariableLHS[~mb~0,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~delta~0,] left hand side expression in assignment: lhs: VariableLHS[~mb~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres10~0,] left hand side expression in assignment: lhs: VariableLHS[~ma~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres10~0,] left hand side expression in assignment: lhs: VariableLHS[~ea~0,] left hand side expression in assignment: lhs: VariableLHS[~ma~0,] left hand side expression in assignment: lhs: VariableLHS[~ma~0,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~res~1,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~__retres10~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~a,] left hand side expression in assignment: lhs: VariableLHS[~b,] left hand side expression in assignment: lhs: VariableLHS[~__retres10~1,] left hand side expression in assignment: lhs: VariableLHS[~ma~1,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~ea~1,] left hand side expression in assignment: lhs: VariableLHS[~ma~1,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~mb~1,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~eb~1,] left hand side expression in assignment: lhs: VariableLHS[~mb~1,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~ea~1,] left hand side expression in assignment: lhs: VariableLHS[~ea~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres10~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres10~1,] left hand side expression in assignment: lhs: VariableLHS[~accu~0,] left hand side expression in assignment: lhs: VariableLHS[~accu~0,] left hand side expression in assignment: lhs: VariableLHS[~accu~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres10~1,] left hand side expression in assignment: lhs: VariableLHS[~ea~1,] left hand side expression in assignment: lhs: VariableLHS[~accu~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres10~1,] left hand side expression in assignment: lhs: VariableLHS[~ma~1,] left hand side expression in assignment: lhs: VariableLHS[~ma~1,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~res~2,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~__retres10~1,] left hand side expression in assignment: lhs: VariableLHS[~zero~0,] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~b~0,] left hand side expression in assignment: lhs: VariableLHS[~r_add1~0,] left hand side expression in assignment: lhs: VariableLHS[~r_add2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres14~0,] [2020-12-23 01:39:23,655 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 01:39:23,667 INFO L203 MainTranslator]: Completed pre-run [2020-12-23 01:39:23,682 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c[425,438] left hand side expression in assignment: lhs: VariableLHS[~__retres4~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres4~0,] left hand side expression in assignment: lhs: VariableLHS[~e,] left hand side expression in assignment: lhs: VariableLHS[~m,] left hand side expression in assignment: lhs: VariableLHS[~__retres4~0,] left hand side expression in assignment: lhs: VariableLHS[~e,] left hand side expression in assignment: lhs: VariableLHS[~m,] left hand side expression in assignment: lhs: VariableLHS[~m,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~res~0,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~__retres4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~a,] left hand side expression in assignment: lhs: VariableLHS[~b,] left hand side expression in assignment: lhs: VariableLHS[~__retres10~0,] left hand side expression in assignment: lhs: VariableLHS[~ma~0,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~ea~0,] left hand side expression in assignment: lhs: VariableLHS[~ma~0,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~mb~0,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~eb~0,] left hand side expression in assignment: lhs: VariableLHS[~mb~0,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~delta~0,] left hand side expression in assignment: lhs: VariableLHS[~mb~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres10~0,] left hand side expression in assignment: lhs: VariableLHS[~ma~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres10~0,] left hand side expression in assignment: lhs: VariableLHS[~ea~0,] left hand side expression in assignment: lhs: VariableLHS[~ma~0,] left hand side expression in assignment: lhs: VariableLHS[~ma~0,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~res~1,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~__retres10~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~a,] left hand side expression in assignment: lhs: VariableLHS[~b,] left hand side expression in assignment: lhs: VariableLHS[~__retres10~1,] left hand side expression in assignment: lhs: VariableLHS[~ma~1,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~ea~1,] left hand side expression in assignment: lhs: VariableLHS[~ma~1,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~mb~1,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~eb~1,] left hand side expression in assignment: lhs: VariableLHS[~mb~1,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~ea~1,] left hand side expression in assignment: lhs: VariableLHS[~ea~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres10~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres10~1,] left hand side expression in assignment: lhs: VariableLHS[~accu~0,] left hand side expression in assignment: lhs: VariableLHS[~accu~0,] left hand side expression in assignment: lhs: VariableLHS[~accu~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres10~1,] left hand side expression in assignment: lhs: VariableLHS[~ea~1,] left hand side expression in assignment: lhs: VariableLHS[~accu~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres10~1,] left hand side expression in assignment: lhs: VariableLHS[~ma~1,] left hand side expression in assignment: lhs: VariableLHS[~ma~1,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~res~2,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~__retres10~1,] left hand side expression in assignment: lhs: VariableLHS[~zero~0,] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~b~0,] left hand side expression in assignment: lhs: VariableLHS[~r_add1~0,] left hand side expression in assignment: lhs: VariableLHS[~r_add2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres14~0,] [2020-12-23 01:39:23,722 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 01:39:23,749 INFO L208 MainTranslator]: Completed translation [2020-12-23 01:39:23,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:39:23 WrapperNode [2020-12-23 01:39:23,750 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 01:39:23,752 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 01:39:23,752 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 01:39:23,752 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 01:39:23,760 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:39:23" (1/1) ... [2020-12-23 01:39:23,787 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:39:23" (1/1) ... [2020-12-23 01:39:23,861 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 01:39:23,862 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 01:39:23,863 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 01:39:23,863 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 01:39:23,873 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:39:23" (1/1) ... [2020-12-23 01:39:23,873 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:39:23" (1/1) ... [2020-12-23 01:39:23,879 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:39:23" (1/1) ... [2020-12-23 01:39:23,879 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:39:23" (1/1) ... [2020-12-23 01:39:23,892 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:39:23" (1/1) ... [2020-12-23 01:39:23,902 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:39:23" (1/1) ... [2020-12-23 01:39:23,907 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:39:23" (1/1) ... [2020-12-23 01:39:23,915 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 01:39:23,916 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 01:39:23,916 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 01:39:23,916 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 01:39:23,917 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:39:23" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/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-23 01:39:24,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 01:39:24,034 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 01:39:24,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 01:39:24,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 01:39:24,955 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 01:39:24,955 INFO L299 CfgBuilder]: Removed 34 assume(true) statements. [2020-12-23 01:39:24,958 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 01:39:24 BoogieIcfgContainer [2020-12-23 01:39:24,958 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 01:39:24,960 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 01:39:24,960 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 01:39:24,964 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 01:39:24,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 01:39:23" (1/3) ... [2020-12-23 01:39:24,966 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ca3b7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 01:39:24, skipping insertion in model container [2020-12-23 01:39:24,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:39:23" (2/3) ... [2020-12-23 01:39:24,967 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ca3b7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 01:39:24, skipping insertion in model container [2020-12-23 01:39:24,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 01:39:24" (3/3) ... [2020-12-23 01:39:24,969 INFO L111 eAbstractionObserver]: Analyzing ICFG soft_float_4-3a.c.cil.c [2020-12-23 01:39:24,977 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 01:39:24,987 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2020-12-23 01:39:25,009 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-12-23 01:39:25,059 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 01:39:25,060 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 01:39:25,060 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 01:39:25,060 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 01:39:25,060 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 01:39:25,060 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 01:39:25,061 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 01:39:25,061 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 01:39:25,095 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states. [2020-12-23 01:39:25,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-23 01:39:25,109 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:39:25,110 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-23 01:39:25,112 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:39:25,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:39:25,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1718575743, now seen corresponding path program 1 times [2020-12-23 01:39:25,131 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:39:25,132 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135766106] [2020-12-23 01:39:25,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:39:25,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:39:25,444 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-23 01:39:25,445 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135766106] [2020-12-23 01:39:25,446 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:39:25,446 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:39:25,447 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025497548] [2020-12-23 01:39:25,452 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:39:25,453 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:39:25,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:39:25,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:39:25,472 INFO L87 Difference]: Start difference. First operand 164 states. Second operand 3 states. [2020-12-23 01:39:25,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:39:25,652 INFO L93 Difference]: Finished difference Result 347 states and 589 transitions. [2020-12-23 01:39:25,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:39:25,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-12-23 01:39:25,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:39:25,668 INFO L225 Difference]: With dead ends: 347 [2020-12-23 01:39:25,668 INFO L226 Difference]: Without dead ends: 181 [2020-12-23 01:39:25,672 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-23 01:39:25,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2020-12-23 01:39:25,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 168. [2020-12-23 01:39:25,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2020-12-23 01:39:25,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 247 transitions. [2020-12-23 01:39:25,779 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 247 transitions. Word has length 22 [2020-12-23 01:39:25,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:39:25,780 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 247 transitions. [2020-12-23 01:39:25,780 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:39:25,780 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 247 transitions. [2020-12-23 01:39:25,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-23 01:39:25,782 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:39:25,782 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-23 01:39:25,782 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 01:39:25,783 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:39:25,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:39:25,783 INFO L82 PathProgramCache]: Analyzing trace with hash 726243562, now seen corresponding path program 1 times [2020-12-23 01:39:25,784 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:39:25,784 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284442409] [2020-12-23 01:39:25,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:39:25,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:39:25,924 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-23 01:39:25,924 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284442409] [2020-12-23 01:39:25,924 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:39:25,925 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-23 01:39:25,925 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453491257] [2020-12-23 01:39:25,926 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 01:39:25,927 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:39:25,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 01:39:25,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-12-23 01:39:25,928 INFO L87 Difference]: Start difference. First operand 168 states and 247 transitions. Second operand 8 states. [2020-12-23 01:39:26,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:39:26,151 INFO L93 Difference]: Finished difference Result 583 states and 807 transitions. [2020-12-23 01:39:26,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 01:39:26,152 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2020-12-23 01:39:26,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:39:26,157 INFO L225 Difference]: With dead ends: 583 [2020-12-23 01:39:26,157 INFO L226 Difference]: Without dead ends: 475 [2020-12-23 01:39:26,159 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2020-12-23 01:39:26,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2020-12-23 01:39:26,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 179. [2020-12-23 01:39:26,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2020-12-23 01:39:26,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 262 transitions. [2020-12-23 01:39:26,180 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 262 transitions. Word has length 23 [2020-12-23 01:39:26,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:39:26,181 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 262 transitions. [2020-12-23 01:39:26,181 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 01:39:26,181 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 262 transitions. [2020-12-23 01:39:26,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-23 01:39:26,183 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:39:26,183 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-23 01:39:26,183 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 01:39:26,183 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:39:26,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:39:26,184 INFO L82 PathProgramCache]: Analyzing trace with hash 984409000, now seen corresponding path program 1 times [2020-12-23 01:39:26,185 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:39:26,185 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147374806] [2020-12-23 01:39:26,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:39:26,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:39:26,338 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-23 01:39:26,338 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147374806] [2020-12-23 01:39:26,339 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:39:26,339 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-23 01:39:26,339 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468266093] [2020-12-23 01:39:26,340 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 01:39:26,340 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:39:26,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 01:39:26,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-12-23 01:39:26,341 INFO L87 Difference]: Start difference. First operand 179 states and 262 transitions. Second operand 9 states. [2020-12-23 01:39:26,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:39:26,621 INFO L93 Difference]: Finished difference Result 485 states and 673 transitions. [2020-12-23 01:39:26,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 01:39:26,622 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-12-23 01:39:26,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:39:26,625 INFO L225 Difference]: With dead ends: 485 [2020-12-23 01:39:26,626 INFO L226 Difference]: Without dead ends: 428 [2020-12-23 01:39:26,627 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2020-12-23 01:39:26,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2020-12-23 01:39:26,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 183. [2020-12-23 01:39:26,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2020-12-23 01:39:26,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 266 transitions. [2020-12-23 01:39:26,643 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 266 transitions. Word has length 23 [2020-12-23 01:39:26,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:39:26,644 INFO L481 AbstractCegarLoop]: Abstraction has 183 states and 266 transitions. [2020-12-23 01:39:26,644 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 01:39:26,644 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 266 transitions. [2020-12-23 01:39:26,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-23 01:39:26,646 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:39:26,646 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-23 01:39:26,646 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 01:39:26,647 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:39:26,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:39:26,648 INFO L82 PathProgramCache]: Analyzing trace with hash 175062374, now seen corresponding path program 1 times [2020-12-23 01:39:26,648 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:39:26,648 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222067871] [2020-12-23 01:39:26,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:39:26,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:39:26,887 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-23 01:39:26,887 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222067871] [2020-12-23 01:39:26,887 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:39:26,888 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-12-23 01:39:26,888 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702375376] [2020-12-23 01:39:26,889 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-12-23 01:39:26,889 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:39:26,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-12-23 01:39:26,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-12-23 01:39:26,890 INFO L87 Difference]: Start difference. First operand 183 states and 266 transitions. Second operand 14 states. [2020-12-23 01:39:27,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:39:27,309 INFO L93 Difference]: Finished difference Result 433 states and 600 transitions. [2020-12-23 01:39:27,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-23 01:39:27,310 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2020-12-23 01:39:27,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:39:27,313 INFO L225 Difference]: With dead ends: 433 [2020-12-23 01:39:27,313 INFO L226 Difference]: Without dead ends: 428 [2020-12-23 01:39:27,314 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=147, Invalid=359, Unknown=0, NotChecked=0, Total=506 [2020-12-23 01:39:27,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2020-12-23 01:39:27,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 187. [2020-12-23 01:39:27,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-12-23 01:39:27,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 270 transitions. [2020-12-23 01:39:27,338 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 270 transitions. Word has length 23 [2020-12-23 01:39:27,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:39:27,338 INFO L481 AbstractCegarLoop]: Abstraction has 187 states and 270 transitions. [2020-12-23 01:39:27,338 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-12-23 01:39:27,338 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 270 transitions. [2020-12-23 01:39:27,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-23 01:39:27,340 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:39:27,340 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-23 01:39:27,340 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 01:39:27,341 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:39:27,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:39:27,341 INFO L82 PathProgramCache]: Analyzing trace with hash 784650434, now seen corresponding path program 1 times [2020-12-23 01:39:27,341 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:39:27,342 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207932348] [2020-12-23 01:39:27,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:39:27,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:39:27,393 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-23 01:39:27,393 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207932348] [2020-12-23 01:39:27,393 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:39:27,394 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 01:39:27,394 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768151537] [2020-12-23 01:39:27,394 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 01:39:27,395 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:39:27,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 01:39:27,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:39:27,396 INFO L87 Difference]: Start difference. First operand 187 states and 270 transitions. Second operand 5 states. [2020-12-23 01:39:27,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:39:27,459 INFO L93 Difference]: Finished difference Result 223 states and 314 transitions. [2020-12-23 01:39:27,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 01:39:27,459 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2020-12-23 01:39:27,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:39:27,461 INFO L225 Difference]: With dead ends: 223 [2020-12-23 01:39:27,461 INFO L226 Difference]: Without dead ends: 204 [2020-12-23 01:39:27,462 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-23 01:39:27,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2020-12-23 01:39:27,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 175. [2020-12-23 01:39:27,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2020-12-23 01:39:27,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 255 transitions. [2020-12-23 01:39:27,469 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 255 transitions. Word has length 25 [2020-12-23 01:39:27,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:39:27,469 INFO L481 AbstractCegarLoop]: Abstraction has 175 states and 255 transitions. [2020-12-23 01:39:27,469 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 01:39:27,469 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 255 transitions. [2020-12-23 01:39:27,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-23 01:39:27,471 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:39:27,471 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-23 01:39:27,471 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 01:39:27,471 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:39:27,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:39:27,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1963804761, now seen corresponding path program 1 times [2020-12-23 01:39:27,472 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:39:27,472 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239632343] [2020-12-23 01:39:27,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:39:27,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:39:27,572 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-23 01:39:27,573 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239632343] [2020-12-23 01:39:27,573 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:39:27,573 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-23 01:39:27,574 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709573257] [2020-12-23 01:39:27,574 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 01:39:27,574 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:39:27,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 01:39:27,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-12-23 01:39:27,575 INFO L87 Difference]: Start difference. First operand 175 states and 255 transitions. Second operand 7 states. [2020-12-23 01:39:28,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:39:28,029 INFO L93 Difference]: Finished difference Result 801 states and 1089 transitions. [2020-12-23 01:39:28,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-23 01:39:28,031 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2020-12-23 01:39:28,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:39:28,035 INFO L225 Difference]: With dead ends: 801 [2020-12-23 01:39:28,035 INFO L226 Difference]: Without dead ends: 693 [2020-12-23 01:39:28,037 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2020-12-23 01:39:28,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2020-12-23 01:39:28,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 295. [2020-12-23 01:39:28,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2020-12-23 01:39:28,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 416 transitions. [2020-12-23 01:39:28,054 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 416 transitions. Word has length 27 [2020-12-23 01:39:28,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:39:28,054 INFO L481 AbstractCegarLoop]: Abstraction has 295 states and 416 transitions. [2020-12-23 01:39:28,054 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 01:39:28,054 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 416 transitions. [2020-12-23 01:39:28,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-23 01:39:28,056 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:39:28,056 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-23 01:39:28,056 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 01:39:28,056 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:39:28,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:39:28,057 INFO L82 PathProgramCache]: Analyzing trace with hash -2072997097, now seen corresponding path program 1 times [2020-12-23 01:39:28,057 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:39:28,058 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576289510] [2020-12-23 01:39:28,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:39:28,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:39:28,271 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-23 01:39:28,271 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576289510] [2020-12-23 01:39:28,272 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:39:28,272 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-23 01:39:28,273 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397015389] [2020-12-23 01:39:28,273 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 01:39:28,273 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:39:28,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 01:39:28,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-12-23 01:39:28,275 INFO L87 Difference]: Start difference. First operand 295 states and 416 transitions. Second operand 9 states. [2020-12-23 01:39:29,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:39:29,252 INFO L93 Difference]: Finished difference Result 915 states and 1187 transitions. [2020-12-23 01:39:29,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2020-12-23 01:39:29,253 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2020-12-23 01:39:29,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:39:29,261 INFO L225 Difference]: With dead ends: 915 [2020-12-23 01:39:29,262 INFO L226 Difference]: Without dead ends: 911 [2020-12-23 01:39:29,266 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=275, Invalid=915, Unknown=0, NotChecked=0, Total=1190 [2020-12-23 01:39:29,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2020-12-23 01:39:29,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 365. [2020-12-23 01:39:29,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2020-12-23 01:39:29,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 511 transitions. [2020-12-23 01:39:29,318 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 511 transitions. Word has length 27 [2020-12-23 01:39:29,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:39:29,318 INFO L481 AbstractCegarLoop]: Abstraction has 365 states and 511 transitions. [2020-12-23 01:39:29,318 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 01:39:29,319 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 511 transitions. [2020-12-23 01:39:29,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-23 01:39:29,325 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:39:29,326 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-23 01:39:29,326 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 01:39:29,326 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:39:29,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:39:29,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1327730277, now seen corresponding path program 1 times [2020-12-23 01:39:29,327 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:39:29,327 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617163028] [2020-12-23 01:39:29,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:39:29,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:39:29,466 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-23 01:39:29,467 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617163028] [2020-12-23 01:39:29,467 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:39:29,467 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-23 01:39:29,467 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489271723] [2020-12-23 01:39:29,468 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 01:39:29,468 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:39:29,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 01:39:29,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-23 01:39:29,469 INFO L87 Difference]: Start difference. First operand 365 states and 511 transitions. Second operand 7 states. [2020-12-23 01:39:29,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:39:29,783 INFO L93 Difference]: Finished difference Result 802 states and 1095 transitions. [2020-12-23 01:39:29,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 01:39:29,784 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2020-12-23 01:39:29,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:39:29,787 INFO L225 Difference]: With dead ends: 802 [2020-12-23 01:39:29,788 INFO L226 Difference]: Without dead ends: 623 [2020-12-23 01:39:29,788 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-12-23 01:39:29,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2020-12-23 01:39:29,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 457. [2020-12-23 01:39:29,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2020-12-23 01:39:29,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 637 transitions. [2020-12-23 01:39:29,814 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 637 transitions. Word has length 27 [2020-12-23 01:39:29,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:39:29,814 INFO L481 AbstractCegarLoop]: Abstraction has 457 states and 637 transitions. [2020-12-23 01:39:29,814 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 01:39:29,814 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 637 transitions. [2020-12-23 01:39:29,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-23 01:39:29,815 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:39:29,816 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-23 01:39:29,816 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 01:39:29,816 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:39:29,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:39:29,817 INFO L82 PathProgramCache]: Analyzing trace with hash -2137076903, now seen corresponding path program 1 times [2020-12-23 01:39:29,817 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:39:29,817 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319651818] [2020-12-23 01:39:29,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:39:29,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:39:29,951 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-23 01:39:29,951 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319651818] [2020-12-23 01:39:29,952 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:39:29,952 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-23 01:39:29,952 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698422894] [2020-12-23 01:39:29,953 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 01:39:29,953 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:39:29,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 01:39:29,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-12-23 01:39:29,954 INFO L87 Difference]: Start difference. First operand 457 states and 637 transitions. Second operand 9 states. [2020-12-23 01:39:30,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:39:30,695 INFO L93 Difference]: Finished difference Result 854 states and 1128 transitions. [2020-12-23 01:39:30,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-12-23 01:39:30,696 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2020-12-23 01:39:30,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:39:30,701 INFO L225 Difference]: With dead ends: 854 [2020-12-23 01:39:30,701 INFO L226 Difference]: Without dead ends: 850 [2020-12-23 01:39:30,702 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2020-12-23 01:39:30,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2020-12-23 01:39:30,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 468. [2020-12-23 01:39:30,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2020-12-23 01:39:30,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 652 transitions. [2020-12-23 01:39:30,734 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 652 transitions. Word has length 27 [2020-12-23 01:39:30,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:39:30,735 INFO L481 AbstractCegarLoop]: Abstraction has 468 states and 652 transitions. [2020-12-23 01:39:30,735 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 01:39:30,735 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 652 transitions. [2020-12-23 01:39:30,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-12-23 01:39:30,736 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:39:30,737 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] [2020-12-23 01:39:30,737 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 01:39:30,737 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:39:30,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:39:30,738 INFO L82 PathProgramCache]: Analyzing trace with hash 766201649, now seen corresponding path program 1 times [2020-12-23 01:39:30,738 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:39:30,738 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278844274] [2020-12-23 01:39:30,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:39:30,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:39:30,935 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-23 01:39:30,936 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278844274] [2020-12-23 01:39:30,936 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:39:30,936 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-23 01:39:30,937 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714166695] [2020-12-23 01:39:30,937 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-23 01:39:30,937 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:39:30,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-23 01:39:30,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-12-23 01:39:30,938 INFO L87 Difference]: Start difference. First operand 468 states and 652 transitions. Second operand 12 states. [2020-12-23 01:39:32,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:39:32,390 INFO L93 Difference]: Finished difference Result 935 states and 1241 transitions. [2020-12-23 01:39:32,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2020-12-23 01:39:32,391 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2020-12-23 01:39:32,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:39:32,406 INFO L225 Difference]: With dead ends: 935 [2020-12-23 01:39:32,406 INFO L226 Difference]: Without dead ends: 910 [2020-12-23 01:39:32,407 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=341, Invalid=1219, Unknown=0, NotChecked=0, Total=1560 [2020-12-23 01:39:32,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2020-12-23 01:39:32,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 521. [2020-12-23 01:39:32,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2020-12-23 01:39:32,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 718 transitions. [2020-12-23 01:39:32,437 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 718 transitions. Word has length 29 [2020-12-23 01:39:32,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:39:32,437 INFO L481 AbstractCegarLoop]: Abstraction has 521 states and 718 transitions. [2020-12-23 01:39:32,437 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-23 01:39:32,437 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 718 transitions. [2020-12-23 01:39:32,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-12-23 01:39:32,439 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:39:32,439 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] [2020-12-23 01:39:32,439 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 01:39:32,439 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:39:32,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:39:32,440 INFO L82 PathProgramCache]: Analyzing trace with hash -456111371, now seen corresponding path program 1 times [2020-12-23 01:39:32,440 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:39:32,440 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296214189] [2020-12-23 01:39:32,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:39:32,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:39:32,488 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-23 01:39:32,489 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296214189] [2020-12-23 01:39:32,489 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:39:32,490 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:39:32,490 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456696944] [2020-12-23 01:39:32,491 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:39:32,491 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:39:32,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:39:32,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:39:32,492 INFO L87 Difference]: Start difference. First operand 521 states and 718 transitions. Second operand 3 states. [2020-12-23 01:39:32,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:39:32,551 INFO L93 Difference]: Finished difference Result 830 states and 1133 transitions. [2020-12-23 01:39:32,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:39:32,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2020-12-23 01:39:32,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:39:32,555 INFO L225 Difference]: With dead ends: 830 [2020-12-23 01:39:32,555 INFO L226 Difference]: Without dead ends: 521 [2020-12-23 01:39:32,556 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-23 01:39:32,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2020-12-23 01:39:32,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 521. [2020-12-23 01:39:32,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2020-12-23 01:39:32,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 711 transitions. [2020-12-23 01:39:32,583 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 711 transitions. Word has length 29 [2020-12-23 01:39:32,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:39:32,583 INFO L481 AbstractCegarLoop]: Abstraction has 521 states and 711 transitions. [2020-12-23 01:39:32,583 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:39:32,583 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 711 transitions. [2020-12-23 01:39:32,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-12-23 01:39:32,585 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:39:32,585 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] [2020-12-23 01:39:32,585 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 01:39:32,585 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:39:32,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:39:32,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1522033216, now seen corresponding path program 1 times [2020-12-23 01:39:32,586 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:39:32,586 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763628194] [2020-12-23 01:39:32,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:39:32,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:39:32,641 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-23 01:39:32,641 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763628194] [2020-12-23 01:39:32,641 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:39:32,642 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 01:39:32,642 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401473100] [2020-12-23 01:39:32,642 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 01:39:32,643 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:39:32,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 01:39:32,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:39:32,644 INFO L87 Difference]: Start difference. First operand 521 states and 711 transitions. Second operand 5 states. [2020-12-23 01:39:32,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:39:32,747 INFO L93 Difference]: Finished difference Result 951 states and 1270 transitions. [2020-12-23 01:39:32,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 01:39:32,748 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2020-12-23 01:39:32,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:39:32,751 INFO L225 Difference]: With dead ends: 951 [2020-12-23 01:39:32,751 INFO L226 Difference]: Without dead ends: 667 [2020-12-23 01:39:32,752 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-23 01:39:32,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2020-12-23 01:39:32,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 529. [2020-12-23 01:39:32,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2020-12-23 01:39:32,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 719 transitions. [2020-12-23 01:39:32,780 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 719 transitions. Word has length 29 [2020-12-23 01:39:32,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:39:32,780 INFO L481 AbstractCegarLoop]: Abstraction has 529 states and 719 transitions. [2020-12-23 01:39:32,780 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 01:39:32,781 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 719 transitions. [2020-12-23 01:39:32,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-12-23 01:39:32,781 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:39:32,782 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] [2020-12-23 01:39:32,782 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 01:39:32,782 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:39:32,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:39:32,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1263867778, now seen corresponding path program 1 times [2020-12-23 01:39:32,783 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:39:32,783 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051400196] [2020-12-23 01:39:32,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:39:32,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:39:32,916 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-23 01:39:32,916 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051400196] [2020-12-23 01:39:32,916 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:39:32,916 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-23 01:39:32,917 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129366985] [2020-12-23 01:39:32,917 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-23 01:39:32,917 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:39:32,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-23 01:39:32,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-12-23 01:39:32,918 INFO L87 Difference]: Start difference. First operand 529 states and 719 transitions. Second operand 10 states. [2020-12-23 01:39:33,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:39:33,370 INFO L93 Difference]: Finished difference Result 847 states and 1129 transitions. [2020-12-23 01:39:33,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-23 01:39:33,371 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2020-12-23 01:39:33,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:39:33,375 INFO L225 Difference]: With dead ends: 847 [2020-12-23 01:39:33,376 INFO L226 Difference]: Without dead ends: 843 [2020-12-23 01:39:33,376 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2020-12-23 01:39:33,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2020-12-23 01:39:33,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 582. [2020-12-23 01:39:33,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2020-12-23 01:39:33,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 789 transitions. [2020-12-23 01:39:33,406 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 789 transitions. Word has length 29 [2020-12-23 01:39:33,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:39:33,407 INFO L481 AbstractCegarLoop]: Abstraction has 582 states and 789 transitions. [2020-12-23 01:39:33,407 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-23 01:39:33,407 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 789 transitions. [2020-12-23 01:39:33,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-12-23 01:39:33,408 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:39:33,408 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] [2020-12-23 01:39:33,408 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 01:39:33,408 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:39:33,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:39:33,409 INFO L82 PathProgramCache]: Analyzing trace with hash -2073214404, now seen corresponding path program 1 times [2020-12-23 01:39:33,409 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:39:33,410 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64899471] [2020-12-23 01:39:33,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:39:33,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:39:33,480 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-23 01:39:33,481 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64899471] [2020-12-23 01:39:33,481 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:39:33,481 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-23 01:39:33,481 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357133061] [2020-12-23 01:39:33,481 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 01:39:33,482 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:39:33,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 01:39:33,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-12-23 01:39:33,483 INFO L87 Difference]: Start difference. First operand 582 states and 789 transitions. Second operand 9 states. [2020-12-23 01:39:33,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:39:33,704 INFO L93 Difference]: Finished difference Result 809 states and 1081 transitions. [2020-12-23 01:39:33,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 01:39:33,705 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2020-12-23 01:39:33,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:39:33,708 INFO L225 Difference]: With dead ends: 809 [2020-12-23 01:39:33,708 INFO L226 Difference]: Without dead ends: 705 [2020-12-23 01:39:33,709 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2020-12-23 01:39:33,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2020-12-23 01:39:33,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 589. [2020-12-23 01:39:33,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2020-12-23 01:39:33,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 797 transitions. [2020-12-23 01:39:33,737 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 797 transitions. Word has length 29 [2020-12-23 01:39:33,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:39:33,737 INFO L481 AbstractCegarLoop]: Abstraction has 589 states and 797 transitions. [2020-12-23 01:39:33,737 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 01:39:33,737 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 797 transitions. [2020-12-23 01:39:33,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-12-23 01:39:33,738 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:39:33,738 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] [2020-12-23 01:39:33,738 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 01:39:33,739 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:39:33,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:39:33,739 INFO L82 PathProgramCache]: Analyzing trace with hash -684949773, now seen corresponding path program 1 times [2020-12-23 01:39:33,739 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:39:33,740 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46058216] [2020-12-23 01:39:33,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:39:33,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:39:33,875 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-23 01:39:33,876 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46058216] [2020-12-23 01:39:33,876 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:39:33,876 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-23 01:39:33,876 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338048790] [2020-12-23 01:39:33,877 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-23 01:39:33,877 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:39:33,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-23 01:39:33,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-12-23 01:39:33,878 INFO L87 Difference]: Start difference. First operand 589 states and 797 transitions. Second operand 10 states. [2020-12-23 01:39:34,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:39:34,467 INFO L93 Difference]: Finished difference Result 881 states and 1175 transitions. [2020-12-23 01:39:34,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-23 01:39:34,468 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2020-12-23 01:39:34,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:39:34,472 INFO L225 Difference]: With dead ends: 881 [2020-12-23 01:39:34,473 INFO L226 Difference]: Without dead ends: 872 [2020-12-23 01:39:34,473 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2020-12-23 01:39:34,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2020-12-23 01:39:34,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 600. [2020-12-23 01:39:34,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2020-12-23 01:39:34,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 811 transitions. [2020-12-23 01:39:34,505 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 811 transitions. Word has length 29 [2020-12-23 01:39:34,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:39:34,505 INFO L481 AbstractCegarLoop]: Abstraction has 600 states and 811 transitions. [2020-12-23 01:39:34,505 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-23 01:39:34,505 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 811 transitions. [2020-12-23 01:39:34,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-12-23 01:39:34,506 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:39:34,507 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] [2020-12-23 01:39:34,507 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-23 01:39:34,507 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:39:34,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:39:34,508 INFO L82 PathProgramCache]: Analyzing trace with hash 225326708, now seen corresponding path program 1 times [2020-12-23 01:39:34,508 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:39:34,508 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243352066] [2020-12-23 01:39:34,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:39:34,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:39:34,583 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-23 01:39:34,584 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243352066] [2020-12-23 01:39:34,584 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:39:34,584 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 01:39:34,584 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360192313] [2020-12-23 01:39:34,585 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 01:39:34,585 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:39:34,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 01:39:34,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-23 01:39:34,586 INFO L87 Difference]: Start difference. First operand 600 states and 811 transitions. Second operand 6 states. [2020-12-23 01:39:34,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:39:34,731 INFO L93 Difference]: Finished difference Result 1093 states and 1458 transitions. [2020-12-23 01:39:34,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 01:39:34,732 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2020-12-23 01:39:34,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:39:34,736 INFO L225 Difference]: With dead ends: 1093 [2020-12-23 01:39:34,736 INFO L226 Difference]: Without dead ends: 903 [2020-12-23 01:39:34,737 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-12-23 01:39:34,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2020-12-23 01:39:34,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 735. [2020-12-23 01:39:34,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 735 states. [2020-12-23 01:39:34,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 992 transitions. [2020-12-23 01:39:34,793 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 992 transitions. Word has length 29 [2020-12-23 01:39:34,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:39:34,793 INFO L481 AbstractCegarLoop]: Abstraction has 735 states and 992 transitions. [2020-12-23 01:39:34,794 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 01:39:34,794 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 992 transitions. [2020-12-23 01:39:34,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-12-23 01:39:34,795 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:39:34,795 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] [2020-12-23 01:39:34,795 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-23 01:39:34,795 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:39:34,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:39:34,796 INFO L82 PathProgramCache]: Analyzing trace with hash -584019918, now seen corresponding path program 1 times [2020-12-23 01:39:34,796 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:39:34,796 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264344994] [2020-12-23 01:39:34,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:39:34,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:39:34,951 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-23 01:39:34,951 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264344994] [2020-12-23 01:39:34,952 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:39:34,952 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-23 01:39:34,952 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919791151] [2020-12-23 01:39:34,953 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-23 01:39:34,953 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:39:34,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-23 01:39:34,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-12-23 01:39:34,954 INFO L87 Difference]: Start difference. First operand 735 states and 992 transitions. Second operand 10 states. [2020-12-23 01:39:35,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:39:35,586 INFO L93 Difference]: Finished difference Result 1028 states and 1377 transitions. [2020-12-23 01:39:35,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-23 01:39:35,586 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2020-12-23 01:39:35,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:39:35,592 INFO L225 Difference]: With dead ends: 1028 [2020-12-23 01:39:35,593 INFO L226 Difference]: Without dead ends: 1017 [2020-12-23 01:39:35,595 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2020-12-23 01:39:35,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2020-12-23 01:39:35,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 731. [2020-12-23 01:39:35,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2020-12-23 01:39:35,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 985 transitions. [2020-12-23 01:39:35,640 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 985 transitions. Word has length 29 [2020-12-23 01:39:35,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:39:35,640 INFO L481 AbstractCegarLoop]: Abstraction has 731 states and 985 transitions. [2020-12-23 01:39:35,641 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-23 01:39:35,641 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 985 transitions. [2020-12-23 01:39:35,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-12-23 01:39:35,642 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:39:35,642 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] [2020-12-23 01:39:35,642 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-23 01:39:35,642 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:39:35,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:39:35,643 INFO L82 PathProgramCache]: Analyzing trace with hash -325854480, now seen corresponding path program 1 times [2020-12-23 01:39:35,643 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:39:35,643 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013127893] [2020-12-23 01:39:35,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:39:35,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:39:35,996 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-23 01:39:35,996 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013127893] [2020-12-23 01:39:35,997 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:39:35,997 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-23 01:39:35,997 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180214905] [2020-12-23 01:39:35,997 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-23 01:39:35,998 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:39:36,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-23 01:39:36,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2020-12-23 01:39:36,004 INFO L87 Difference]: Start difference. First operand 731 states and 985 transitions. Second operand 13 states. [2020-12-23 01:39:36,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:39:36,574 INFO L93 Difference]: Finished difference Result 908 states and 1199 transitions. [2020-12-23 01:39:36,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-23 01:39:36,575 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 29 [2020-12-23 01:39:36,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:39:36,579 INFO L225 Difference]: With dead ends: 908 [2020-12-23 01:39:36,579 INFO L226 Difference]: Without dead ends: 818 [2020-12-23 01:39:36,582 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2020-12-23 01:39:36,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2020-12-23 01:39:36,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 692. [2020-12-23 01:39:36,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 692 states. [2020-12-23 01:39:36,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 934 transitions. [2020-12-23 01:39:36,622 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 934 transitions. Word has length 29 [2020-12-23 01:39:36,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:39:36,622 INFO L481 AbstractCegarLoop]: Abstraction has 692 states and 934 transitions. [2020-12-23 01:39:36,623 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-23 01:39:36,623 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 934 transitions. [2020-12-23 01:39:36,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-12-23 01:39:36,624 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:39:36,624 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-23 01:39:36,624 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-23 01:39:36,624 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:39:36,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:39:36,625 INFO L82 PathProgramCache]: Analyzing trace with hash 950396632, now seen corresponding path program 1 times [2020-12-23 01:39:36,625 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:39:36,625 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789140129] [2020-12-23 01:39:36,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:39:36,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:39:36,805 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-23 01:39:36,806 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789140129] [2020-12-23 01:39:36,806 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:39:36,806 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-23 01:39:36,806 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802143039] [2020-12-23 01:39:36,808 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-23 01:39:36,808 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:39:36,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-23 01:39:36,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-12-23 01:39:36,813 INFO L87 Difference]: Start difference. First operand 692 states and 934 transitions. Second operand 10 states. [2020-12-23 01:39:37,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:39:37,271 INFO L93 Difference]: Finished difference Result 954 states and 1271 transitions. [2020-12-23 01:39:37,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-23 01:39:37,271 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2020-12-23 01:39:37,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:39:37,276 INFO L225 Difference]: With dead ends: 954 [2020-12-23 01:39:37,276 INFO L226 Difference]: Without dead ends: 945 [2020-12-23 01:39:37,277 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2020-12-23 01:39:37,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2020-12-23 01:39:37,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 667. [2020-12-23 01:39:37,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 667 states. [2020-12-23 01:39:37,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 901 transitions. [2020-12-23 01:39:37,317 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 901 transitions. Word has length 31 [2020-12-23 01:39:37,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:39:37,317 INFO L481 AbstractCegarLoop]: Abstraction has 667 states and 901 transitions. [2020-12-23 01:39:37,318 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-23 01:39:37,318 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 901 transitions. [2020-12-23 01:39:37,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-12-23 01:39:37,319 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:39:37,319 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-23 01:39:37,319 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-23 01:39:37,319 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:39:37,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:39:37,321 INFO L82 PathProgramCache]: Analyzing trace with hash 557369622, now seen corresponding path program 1 times [2020-12-23 01:39:37,321 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:39:37,321 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447932175] [2020-12-23 01:39:37,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:39:37,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:39:37,605 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-23 01:39:37,605 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447932175] [2020-12-23 01:39:37,605 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:39:37,605 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-23 01:39:37,606 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501406546] [2020-12-23 01:39:37,606 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-23 01:39:37,606 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:39:37,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-23 01:39:37,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2020-12-23 01:39:37,607 INFO L87 Difference]: Start difference. First operand 667 states and 901 transitions. Second operand 12 states. [2020-12-23 01:39:38,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:39:38,210 INFO L93 Difference]: Finished difference Result 784 states and 1046 transitions. [2020-12-23 01:39:38,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-23 01:39:38,211 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2020-12-23 01:39:38,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:39:38,215 INFO L225 Difference]: With dead ends: 784 [2020-12-23 01:39:38,215 INFO L226 Difference]: Without dead ends: 774 [2020-12-23 01:39:38,216 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2020-12-23 01:39:38,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2020-12-23 01:39:38,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 667. [2020-12-23 01:39:38,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 667 states. [2020-12-23 01:39:38,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 900 transitions. [2020-12-23 01:39:38,250 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 900 transitions. Word has length 31 [2020-12-23 01:39:38,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:39:38,251 INFO L481 AbstractCegarLoop]: Abstraction has 667 states and 900 transitions. [2020-12-23 01:39:38,251 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-23 01:39:38,251 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 900 transitions. [2020-12-23 01:39:38,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-12-23 01:39:38,252 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:39:38,252 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] [2020-12-23 01:39:38,252 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-23 01:39:38,252 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:39:38,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:39:38,253 INFO L82 PathProgramCache]: Analyzing trace with hash -368381595, now seen corresponding path program 1 times [2020-12-23 01:39:38,253 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:39:38,253 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294785004] [2020-12-23 01:39:38,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:39:38,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:39:38,299 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-23 01:39:38,300 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294785004] [2020-12-23 01:39:38,300 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:39:38,300 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-23 01:39:38,300 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768360587] [2020-12-23 01:39:38,301 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 01:39:38,301 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:39:38,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 01:39:38,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-23 01:39:38,302 INFO L87 Difference]: Start difference. First operand 667 states and 900 transitions. Second operand 7 states. [2020-12-23 01:39:38,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:39:38,465 INFO L93 Difference]: Finished difference Result 792 states and 1051 transitions. [2020-12-23 01:39:38,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 01:39:38,466 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2020-12-23 01:39:38,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:39:38,469 INFO L225 Difference]: With dead ends: 792 [2020-12-23 01:39:38,469 INFO L226 Difference]: Without dead ends: 694 [2020-12-23 01:39:38,472 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-12-23 01:39:38,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2020-12-23 01:39:38,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 587. [2020-12-23 01:39:38,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2020-12-23 01:39:38,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 789 transitions. [2020-12-23 01:39:38,502 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 789 transitions. Word has length 32 [2020-12-23 01:39:38,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:39:38,502 INFO L481 AbstractCegarLoop]: Abstraction has 587 states and 789 transitions. [2020-12-23 01:39:38,502 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 01:39:38,503 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 789 transitions. [2020-12-23 01:39:38,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-23 01:39:38,504 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:39:38,504 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-23 01:39:38,504 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-23 01:39:38,504 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:39:38,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:39:38,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1649328842, now seen corresponding path program 1 times [2020-12-23 01:39:38,505 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:39:38,505 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609004483] [2020-12-23 01:39:38,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:39:38,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:39:38,612 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-23 01:39:38,613 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609004483] [2020-12-23 01:39:38,613 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:39:38,613 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 01:39:38,613 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043818976] [2020-12-23 01:39:38,614 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 01:39:38,614 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:39:38,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 01:39:38,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-23 01:39:38,615 INFO L87 Difference]: Start difference. First operand 587 states and 789 transitions. Second operand 6 states. [2020-12-23 01:39:38,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:39:38,948 INFO L93 Difference]: Finished difference Result 895 states and 1181 transitions. [2020-12-23 01:39:38,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 01:39:38,951 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2020-12-23 01:39:38,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:39:38,955 INFO L225 Difference]: With dead ends: 895 [2020-12-23 01:39:38,955 INFO L226 Difference]: Without dead ends: 880 [2020-12-23 01:39:38,956 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-12-23 01:39:38,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2020-12-23 01:39:38,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 589. [2020-12-23 01:39:38,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2020-12-23 01:39:38,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 790 transitions. [2020-12-23 01:39:38,993 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 790 transitions. Word has length 35 [2020-12-23 01:39:38,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:39:38,993 INFO L481 AbstractCegarLoop]: Abstraction has 589 states and 790 transitions. [2020-12-23 01:39:38,993 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 01:39:38,993 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 790 transitions. [2020-12-23 01:39:38,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-23 01:39:38,994 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:39:38,994 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-23 01:39:38,994 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-23 01:39:38,994 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:39:38,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:39:38,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1098147654, now seen corresponding path program 1 times [2020-12-23 01:39:38,995 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:39:38,995 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791003566] [2020-12-23 01:39:38,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:39:39,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:39:39,136 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-23 01:39:39,136 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791003566] [2020-12-23 01:39:39,136 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:39:39,137 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-23 01:39:39,137 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412529855] [2020-12-23 01:39:39,137 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 01:39:39,137 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:39:39,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 01:39:39,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-12-23 01:39:39,138 INFO L87 Difference]: Start difference. First operand 589 states and 790 transitions. Second operand 9 states. [2020-12-23 01:39:39,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:39:39,532 INFO L93 Difference]: Finished difference Result 869 states and 1151 transitions. [2020-12-23 01:39:39,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 01:39:39,532 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2020-12-23 01:39:39,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:39:39,536 INFO L225 Difference]: With dead ends: 869 [2020-12-23 01:39:39,537 INFO L226 Difference]: Without dead ends: 865 [2020-12-23 01:39:39,537 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2020-12-23 01:39:39,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2020-12-23 01:39:39,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 617. [2020-12-23 01:39:39,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2020-12-23 01:39:39,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 827 transitions. [2020-12-23 01:39:39,572 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 827 transitions. Word has length 35 [2020-12-23 01:39:39,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:39:39,572 INFO L481 AbstractCegarLoop]: Abstraction has 617 states and 827 transitions. [2020-12-23 01:39:39,572 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 01:39:39,572 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 827 transitions. [2020-12-23 01:39:39,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-23 01:39:39,573 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:39:39,573 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] [2020-12-23 01:39:39,574 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-23 01:39:39,574 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:39:39,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:39:39,574 INFO L82 PathProgramCache]: Analyzing trace with hash 570408963, now seen corresponding path program 1 times [2020-12-23 01:39:39,575 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:39:39,575 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119812696] [2020-12-23 01:39:39,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:39:39,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:39:39,620 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-23 01:39:39,621 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119812696] [2020-12-23 01:39:39,621 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:39:39,621 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-23 01:39:39,621 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211101578] [2020-12-23 01:39:39,622 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 01:39:39,622 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:39:39,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 01:39:39,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-23 01:39:39,623 INFO L87 Difference]: Start difference. First operand 617 states and 827 transitions. Second operand 7 states. [2020-12-23 01:39:39,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:39:39,777 INFO L93 Difference]: Finished difference Result 724 states and 963 transitions. [2020-12-23 01:39:39,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 01:39:39,777 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2020-12-23 01:39:39,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:39:39,780 INFO L225 Difference]: With dead ends: 724 [2020-12-23 01:39:39,781 INFO L226 Difference]: Without dead ends: 605 [2020-12-23 01:39:39,781 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-12-23 01:39:39,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2020-12-23 01:39:39,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 603. [2020-12-23 01:39:39,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2020-12-23 01:39:39,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 809 transitions. [2020-12-23 01:39:39,812 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 809 transitions. Word has length 36 [2020-12-23 01:39:39,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:39:39,812 INFO L481 AbstractCegarLoop]: Abstraction has 603 states and 809 transitions. [2020-12-23 01:39:39,812 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 01:39:39,812 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 809 transitions. [2020-12-23 01:39:39,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-23 01:39:39,813 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:39:39,813 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] [2020-12-23 01:39:39,813 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-12-23 01:39:39,814 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:39:39,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:39:39,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1389892904, now seen corresponding path program 1 times [2020-12-23 01:39:39,814 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:39:39,815 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369891987] [2020-12-23 01:39:39,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:39:39,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:39:39,865 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-23 01:39:39,865 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369891987] [2020-12-23 01:39:39,865 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:39:39,865 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-23 01:39:39,866 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306805943] [2020-12-23 01:39:39,866 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 01:39:39,866 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:39:39,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 01:39:39,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-23 01:39:39,867 INFO L87 Difference]: Start difference. First operand 603 states and 809 transitions. Second operand 7 states. [2020-12-23 01:39:40,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:39:40,327 INFO L93 Difference]: Finished difference Result 1022 states and 1333 transitions. [2020-12-23 01:39:40,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-23 01:39:40,327 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2020-12-23 01:39:40,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:39:40,330 INFO L225 Difference]: With dead ends: 1022 [2020-12-23 01:39:40,330 INFO L226 Difference]: Without dead ends: 467 [2020-12-23 01:39:40,331 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2020-12-23 01:39:40,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2020-12-23 01:39:40,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 374. [2020-12-23 01:39:40,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-12-23 01:39:40,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 504 transitions. [2020-12-23 01:39:40,356 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 504 transitions. Word has length 36 [2020-12-23 01:39:40,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:39:40,357 INFO L481 AbstractCegarLoop]: Abstraction has 374 states and 504 transitions. [2020-12-23 01:39:40,357 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 01:39:40,357 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 504 transitions. [2020-12-23 01:39:40,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-12-23 01:39:40,358 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:39:40,358 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-23 01:39:40,358 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-12-23 01:39:40,358 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:39:40,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:39:40,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1190472800, now seen corresponding path program 1 times [2020-12-23 01:39:40,359 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:39:40,359 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161959655] [2020-12-23 01:39:40,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:39:40,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:39:40,486 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-23 01:39:40,487 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161959655] [2020-12-23 01:39:40,487 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:39:40,487 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-23 01:39:40,487 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369916245] [2020-12-23 01:39:40,488 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 01:39:40,488 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:39:40,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 01:39:40,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-23 01:39:40,489 INFO L87 Difference]: Start difference. First operand 374 states and 504 transitions. Second operand 8 states. [2020-12-23 01:39:40,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:39:40,796 INFO L93 Difference]: Finished difference Result 517 states and 680 transitions. [2020-12-23 01:39:40,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 01:39:40,796 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2020-12-23 01:39:40,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:39:40,798 INFO L225 Difference]: With dead ends: 517 [2020-12-23 01:39:40,798 INFO L226 Difference]: Without dead ends: 508 [2020-12-23 01:39:40,799 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-12-23 01:39:40,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2020-12-23 01:39:40,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 379. [2020-12-23 01:39:40,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2020-12-23 01:39:40,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 509 transitions. [2020-12-23 01:39:40,825 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 509 transitions. Word has length 37 [2020-12-23 01:39:40,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:39:40,826 INFO L481 AbstractCegarLoop]: Abstraction has 379 states and 509 transitions. [2020-12-23 01:39:40,826 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 01:39:40,826 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 509 transitions. [2020-12-23 01:39:40,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-12-23 01:39:40,826 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:39:40,827 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-23 01:39:40,827 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-12-23 01:39:40,827 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:39:40,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:39:40,827 INFO L82 PathProgramCache]: Analyzing trace with hash -642972657, now seen corresponding path program 1 times [2020-12-23 01:39:40,828 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:39:40,828 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224631613] [2020-12-23 01:39:40,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:39:40,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:39:40,870 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-23 01:39:40,870 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224631613] [2020-12-23 01:39:40,870 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:39:40,871 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 01:39:40,871 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758272768] [2020-12-23 01:39:40,871 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 01:39:40,871 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:39:40,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 01:39:40,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-23 01:39:40,872 INFO L87 Difference]: Start difference. First operand 379 states and 509 transitions. Second operand 6 states. [2020-12-23 01:39:41,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:39:41,017 INFO L93 Difference]: Finished difference Result 570 states and 762 transitions. [2020-12-23 01:39:41,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 01:39:41,018 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2020-12-23 01:39:41,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:39:41,019 INFO L225 Difference]: With dead ends: 570 [2020-12-23 01:39:41,019 INFO L226 Difference]: Without dead ends: 272 [2020-12-23 01:39:41,020 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-23 01:39:41,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2020-12-23 01:39:41,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 270. [2020-12-23 01:39:41,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2020-12-23 01:39:41,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 360 transitions. [2020-12-23 01:39:41,038 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 360 transitions. Word has length 38 [2020-12-23 01:39:41,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:39:41,038 INFO L481 AbstractCegarLoop]: Abstraction has 270 states and 360 transitions. [2020-12-23 01:39:41,038 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 01:39:41,039 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 360 transitions. [2020-12-23 01:39:41,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-12-23 01:39:41,039 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:39:41,039 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-23 01:39:41,039 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-12-23 01:39:41,040 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:39:41,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:39:41,040 INFO L82 PathProgramCache]: Analyzing trace with hash -345767534, now seen corresponding path program 1 times [2020-12-23 01:39:41,040 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:39:41,041 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620057622] [2020-12-23 01:39:41,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:39:41,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:39:41,098 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-23 01:39:41,098 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620057622] [2020-12-23 01:39:41,098 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:39:41,098 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-23 01:39:41,098 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597014767] [2020-12-23 01:39:41,099 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 01:39:41,099 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:39:41,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 01:39:41,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-12-23 01:39:41,100 INFO L87 Difference]: Start difference. First operand 270 states and 360 transitions. Second operand 8 states. [2020-12-23 01:39:41,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:39:41,529 INFO L93 Difference]: Finished difference Result 560 states and 722 transitions. [2020-12-23 01:39:41,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-23 01:39:41,530 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2020-12-23 01:39:41,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:39:41,531 INFO L225 Difference]: With dead ends: 560 [2020-12-23 01:39:41,531 INFO L226 Difference]: Without dead ends: 265 [2020-12-23 01:39:41,532 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2020-12-23 01:39:41,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2020-12-23 01:39:41,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 155. [2020-12-23 01:39:41,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2020-12-23 01:39:41,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 202 transitions. [2020-12-23 01:39:41,547 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 202 transitions. Word has length 40 [2020-12-23 01:39:41,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:39:41,547 INFO L481 AbstractCegarLoop]: Abstraction has 155 states and 202 transitions. [2020-12-23 01:39:41,547 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 01:39:41,547 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 202 transitions. [2020-12-23 01:39:41,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-12-23 01:39:41,548 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:39:41,548 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, 1, 1, 1, 1] [2020-12-23 01:39:41,548 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-12-23 01:39:41,548 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:39:41,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:39:41,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1540195756, now seen corresponding path program 1 times [2020-12-23 01:39:41,549 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:39:41,549 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133371627] [2020-12-23 01:39:41,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:39:41,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:39:41,621 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-23 01:39:41,621 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133371627] [2020-12-23 01:39:41,621 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:39:41,622 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-23 01:39:41,622 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592376100] [2020-12-23 01:39:41,622 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 01:39:41,622 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:39:41,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 01:39:41,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-12-23 01:39:41,623 INFO L87 Difference]: Start difference. First operand 155 states and 202 transitions. Second operand 9 states. [2020-12-23 01:39:41,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:39:41,996 INFO L93 Difference]: Finished difference Result 213 states and 263 transitions. [2020-12-23 01:39:41,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-23 01:39:41,997 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 44 [2020-12-23 01:39:41,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:39:41,998 INFO L225 Difference]: With dead ends: 213 [2020-12-23 01:39:41,998 INFO L226 Difference]: Without dead ends: 0 [2020-12-23 01:39:41,998 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2020-12-23 01:39:41,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-23 01:39:41,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-23 01:39:41,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-23 01:39:41,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-23 01:39:41,999 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 44 [2020-12-23 01:39:41,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:39:42,000 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-23 01:39:42,000 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 01:39:42,000 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-23 01:39:42,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-23 01:39:42,000 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-12-23 01:39:42,003 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-12-23 01:39:43,262 WARN L197 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 235 DAG size of output: 185 [2020-12-23 01:39:43,413 WARN L197 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 144 [2020-12-23 01:39:44,392 WARN L197 SmtUtils]: Spent 963.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 176 [2020-12-23 01:39:44,510 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 119 [2020-12-23 01:39:46,695 WARN L197 SmtUtils]: Spent 2.14 s on a formula simplification. DAG size of input: 185 DAG size of output: 63 [2020-12-23 01:39:47,846 WARN L197 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 135 DAG size of output: 67 [2020-12-23 01:39:50,012 WARN L197 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 176 DAG size of output: 44 [2020-12-23 01:39:50,675 WARN L197 SmtUtils]: Spent 655.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 60 [2020-12-23 01:39:50,686 INFO L189 CegarLoopUtils]: For program point L68-3(line 68) no Hoare annotation was computed. [2020-12-23 01:39:50,686 INFO L189 CegarLoopUtils]: For program point L68-5(line 68) no Hoare annotation was computed. [2020-12-23 01:39:50,686 INFO L189 CegarLoopUtils]: For program point L68-7(lines 20 73) no Hoare annotation was computed. [2020-12-23 01:39:50,686 INFO L189 CegarLoopUtils]: For program point L68-9(line 68) no Hoare annotation was computed. [2020-12-23 01:39:50,686 INFO L189 CegarLoopUtils]: For program point L68-11(line 68) no Hoare annotation was computed. [2020-12-23 01:39:50,687 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2020-12-23 01:39:50,687 INFO L189 CegarLoopUtils]: For program point L68-13(line 68) no Hoare annotation was computed. [2020-12-23 01:39:50,687 INFO L189 CegarLoopUtils]: For program point L68-15(lines 20 73) no Hoare annotation was computed. [2020-12-23 01:39:50,687 INFO L189 CegarLoopUtils]: For program point L68-17(line 68) no Hoare annotation was computed. [2020-12-23 01:39:50,687 INFO L189 CegarLoopUtils]: For program point L68-19(line 68) no Hoare annotation was computed. [2020-12-23 01:39:50,687 INFO L189 CegarLoopUtils]: For program point L68-21(line 68) no Hoare annotation was computed. [2020-12-23 01:39:50,687 INFO L189 CegarLoopUtils]: For program point L68-23(lines 20 73) no Hoare annotation was computed. [2020-12-23 01:39:50,687 INFO L189 CegarLoopUtils]: For program point L102(line 102) no Hoare annotation was computed. [2020-12-23 01:39:50,688 INFO L189 CegarLoopUtils]: For program point L69-1(line 69) no Hoare annotation was computed. [2020-12-23 01:39:50,688 INFO L189 CegarLoopUtils]: For program point L102-2(line 102) no Hoare annotation was computed. [2020-12-23 01:39:50,688 INFO L189 CegarLoopUtils]: For program point L69-3(line 69) no Hoare annotation was computed. [2020-12-23 01:39:50,688 INFO L189 CegarLoopUtils]: For program point L102-4(line 102) no Hoare annotation was computed. [2020-12-23 01:39:50,688 INFO L189 CegarLoopUtils]: For program point L69-5(line 69) no Hoare annotation was computed. [2020-12-23 01:39:50,689 INFO L189 CegarLoopUtils]: For program point L102-6(line 102) no Hoare annotation was computed. [2020-12-23 01:39:50,689 INFO L189 CegarLoopUtils]: For program point L69-7(line 69) no Hoare annotation was computed. [2020-12-23 01:39:50,689 INFO L189 CegarLoopUtils]: For program point L102-8(lines 99 110) no Hoare annotation was computed. [2020-12-23 01:39:50,689 INFO L189 CegarLoopUtils]: For program point L102-9(line 102) no Hoare annotation was computed. [2020-12-23 01:39:50,689 INFO L189 CegarLoopUtils]: For program point L69-9(line 69) no Hoare annotation was computed. [2020-12-23 01:39:50,690 INFO L189 CegarLoopUtils]: For program point L102-11(line 102) no Hoare annotation was computed. [2020-12-23 01:39:50,690 INFO L189 CegarLoopUtils]: For program point L69-11(line 69) no Hoare annotation was computed. [2020-12-23 01:39:50,690 INFO L189 CegarLoopUtils]: For program point L102-13(line 102) no Hoare annotation was computed. [2020-12-23 01:39:50,690 INFO L189 CegarLoopUtils]: For program point L69-13(line 69) no Hoare annotation was computed. [2020-12-23 01:39:50,690 INFO L189 CegarLoopUtils]: For program point L102-15(line 102) no Hoare annotation was computed. [2020-12-23 01:39:50,690 INFO L189 CegarLoopUtils]: For program point L69-15(line 69) no Hoare annotation was computed. [2020-12-23 01:39:50,690 INFO L189 CegarLoopUtils]: For program point L102-17(lines 99 110) no Hoare annotation was computed. [2020-12-23 01:39:50,690 INFO L189 CegarLoopUtils]: For program point L69-17(line 69) no Hoare annotation was computed. [2020-12-23 01:39:50,691 INFO L189 CegarLoopUtils]: For program point L69-19(line 69) no Hoare annotation was computed. [2020-12-23 01:39:50,691 INFO L189 CegarLoopUtils]: For program point L69-21(line 69) no Hoare annotation was computed. [2020-12-23 01:39:50,691 INFO L189 CegarLoopUtils]: For program point L69-23(line 69) no Hoare annotation was computed. [2020-12-23 01:39:50,691 INFO L185 CegarLoopUtils]: At program point L136(lines 85 138) the Hoare annotation is: (let ((.cse2 (= ULTIMATE.start_main_~a~0 0)) (.cse7 (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_addflt_~__retres10~0)) (.cse8 (<= ULTIMATE.start_addflt_~a ULTIMATE.start_main_~b~0)) (.cse4 (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_addflt_~a)) (.cse6 (<= ULTIMATE.start_addflt_~__retres10~0 ULTIMATE.start_main_~b~0)) (.cse5 (<= 4294967295 ULTIMATE.start_addflt_~__retres10~0)) (.cse9 (<= 0 |ULTIMATE.start_base2flt_#res|)) (.cse12 (= ULTIMATE.start_main_~a~0 ULTIMATE.start_addflt_~a)) (.cse0 (<= ULTIMATE.start_addflt_~b ULTIMATE.start_main_~b~0)) (.cse13 (<= ULTIMATE.start_addflt_~__retres10~0 ULTIMATE.start_main_~a~0)) (.cse14 (<= ULTIMATE.start_main_~a~0 ULTIMATE.start_addflt_~__retres10~0)) (.cse1 (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_addflt_~b)) (.cse10 (<= 0 ULTIMATE.start_base2flt_~res~0)) (.cse3 (<= ULTIMATE.start_main_~b~0 (* 4294967296 (div ULTIMATE.start_main_~b~0 4294967296)))) (.cse11 (<= 0 ULTIMATE.start_base2flt_~__retres4~0))) (or (and (= ULTIMATE.start_addflt_~__retres10~0 0) .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_addflt_~a 0)) (and (<= ULTIMATE.start_base2flt_~__retres4~0 4294967295) (<= 4294967295 |ULTIMATE.start_base2flt_#res|) (<= |ULTIMATE.start_base2flt_#res| 4294967295) (<= ULTIMATE.start_addflt_~a 4294967295) .cse4 (<= 4294967295 ULTIMATE.start_base2flt_~__retres4~0) .cse5 .cse6) (and .cse7 .cse8 .cse2 .cse4 .cse6) (and .cse7 .cse9 .cse8 .cse10 (<= 0 ULTIMATE.start_main_~b~0) .cse4 .cse6 .cse11 (<= ULTIMATE.start_addflt_~a (+ (* 4294967296 (div (+ ULTIMATE.start_addflt_~a (- 1)) 4294967296)) 4294967295))) (and .cse12 .cse13 .cse14 (= |ULTIMATE.start_base2flt_#res| 0) (= ULTIMATE.start_addflt_~b 0) (= ULTIMATE.start_base2flt_~__retres4~0 0) (= ULTIMATE.start_main_~b~0 0)) (and (<= ULTIMATE.start_addflt_~__retres10~0 4294967295) .cse12 (<= 4294967295 ULTIMATE.start_main_~a~0) .cse0 (<= ULTIMATE.start_main_~a~0 4294967295) .cse1 .cse5) (and .cse9 .cse12 .cse0 .cse13 .cse14 .cse1 .cse10 .cse3 (<= 0 ULTIMATE.start_addflt_~b) .cse11))) [2020-12-23 01:39:50,692 INFO L185 CegarLoopUtils]: At program point L136-1(lines 85 138) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_addflt_~b ULTIMATE.start_main_~b~0)) (.cse1 (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_addflt_~b)) (.cse4 (<= ULTIMATE.start_addflt_~a ULTIMATE.start_main_~b~0)) (.cse5 (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_addflt_~a))) (or (and (<= ULTIMATE.start_main_~r_add1~0 ULTIMATE.start_addflt_~__retres10~0) (<= ULTIMATE.start_addflt_~__retres10~0 ULTIMATE.start_main_~r_add1~0) (let ((.cse2 (<= ULTIMATE.start_main_~r_add1~0 ULTIMATE.start_addflt_~a)) (.cse3 (<= ULTIMATE.start_addflt_~a ULTIMATE.start_main_~r_add1~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse2 .cse3)))) (and (<= ULTIMATE.start_addflt_~__retres10~0 4294967295) (<= 4294967295 ULTIMATE.start_main_~r_add1~0) (<= ULTIMATE.start_main_~r_add1~0 4294967295) (<= 4294967295 ULTIMATE.start_addflt_~__retres10~0)) (and (<= ULTIMATE.start_main_~r_add1~0 (* 4294967296 (div ULTIMATE.start_main_~r_add1~0 4294967296))) (or (and .cse0 .cse1) (and .cse4 .cse5)) (<= ULTIMATE.start_addflt_~a (* 4294967296 (div ULTIMATE.start_addflt_~a 4294967296))) (<= ULTIMATE.start_addflt_~__retres10~0 (* 4294967296 (div ULTIMATE.start_addflt_~__retres10~0 4294967296))) (<= ULTIMATE.start_main_~b~0 (* 4294967296 (div ULTIMATE.start_main_~b~0 4294967296)))))) [2020-12-23 01:39:50,692 INFO L189 CegarLoopUtils]: For program point L103-1(line 103) no Hoare annotation was computed. [2020-12-23 01:39:50,692 INFO L189 CegarLoopUtils]: For program point L103-3(line 103) no Hoare annotation was computed. [2020-12-23 01:39:50,692 INFO L189 CegarLoopUtils]: For program point L103-5(line 103) no Hoare annotation was computed. [2020-12-23 01:39:50,692 INFO L189 CegarLoopUtils]: For program point L103-7(line 103) no Hoare annotation was computed. [2020-12-23 01:39:50,692 INFO L189 CegarLoopUtils]: For program point L103-9(line 103) no Hoare annotation was computed. [2020-12-23 01:39:50,693 INFO L189 CegarLoopUtils]: For program point L103-11(line 103) no Hoare annotation was computed. [2020-12-23 01:39:50,693 INFO L189 CegarLoopUtils]: For program point L103-13(line 103) no Hoare annotation was computed. [2020-12-23 01:39:50,693 INFO L189 CegarLoopUtils]: For program point L103-15(line 103) no Hoare annotation was computed. [2020-12-23 01:39:50,693 INFO L185 CegarLoopUtils]: At program point L137(lines 75 139) the Hoare annotation is: (let ((.cse2 (= ULTIMATE.start_main_~a~0 0)) (.cse0 (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_addflt_~__retres10~0)) (.cse1 (<= ULTIMATE.start_addflt_~a ULTIMATE.start_main_~b~0)) (.cse3 (<= |ULTIMATE.start_addflt_#res| ULTIMATE.start_main_~b~0)) (.cse4 (<= ULTIMATE.start_main_~b~0 |ULTIMATE.start_addflt_#res|)) (.cse5 (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_addflt_~a)) (.cse6 (<= ULTIMATE.start_addflt_~__retres10~0 ULTIMATE.start_main_~b~0)) (.cse7 (<= 4294967295 ULTIMATE.start_addflt_~__retres10~0)) (.cse11 (<= 0 |ULTIMATE.start_base2flt_#res|)) (.cse14 (= ULTIMATE.start_main_~a~0 ULTIMATE.start_addflt_~a)) (.cse8 (<= ULTIMATE.start_addflt_~b ULTIMATE.start_main_~b~0)) (.cse15 (<= ULTIMATE.start_addflt_~__retres10~0 ULTIMATE.start_main_~a~0)) (.cse16 (<= ULTIMATE.start_main_~a~0 ULTIMATE.start_addflt_~__retres10~0)) (.cse9 (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_addflt_~b)) (.cse12 (<= 0 ULTIMATE.start_base2flt_~res~0)) (.cse10 (<= ULTIMATE.start_main_~b~0 (* 4294967296 (div ULTIMATE.start_main_~b~0 4294967296)))) (.cse13 (<= 0 ULTIMATE.start_base2flt_~__retres4~0)) (.cse17 (<= ULTIMATE.start_main_~a~0 |ULTIMATE.start_addflt_#res|)) (.cse18 (<= |ULTIMATE.start_addflt_#res| ULTIMATE.start_main_~a~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and (<= ULTIMATE.start_base2flt_~__retres4~0 4294967295) (<= 4294967295 |ULTIMATE.start_base2flt_#res|) .cse3 (<= |ULTIMATE.start_base2flt_#res| 4294967295) (<= ULTIMATE.start_addflt_~a 4294967295) .cse4 .cse5 (<= 4294967295 ULTIMATE.start_base2flt_~__retres4~0) .cse7 .cse6) (and (= ULTIMATE.start_addflt_~__retres10~0 0) (= |ULTIMATE.start_addflt_#res| 0) .cse8 .cse9 .cse2 .cse10 (= ULTIMATE.start_addflt_~a 0)) (and .cse11 .cse0 .cse1 .cse12 .cse3 (<= 0 ULTIMATE.start_main_~b~0) .cse4 .cse5 .cse6 .cse13 (<= ULTIMATE.start_addflt_~a (+ (* 4294967296 (div (+ ULTIMATE.start_addflt_~a (- 1)) 4294967296)) 4294967295))) (and .cse14 .cse15 .cse16 (= |ULTIMATE.start_base2flt_#res| 0) (= ULTIMATE.start_addflt_~b 0) (= ULTIMATE.start_base2flt_~__retres4~0 0) .cse17 .cse18 (= ULTIMATE.start_main_~b~0 0)) (and .cse14 (<= 4294967295 |ULTIMATE.start_addflt_#res|) .cse8 .cse15 (<= ULTIMATE.start_main_~a~0 4294967295) .cse9 (<= |ULTIMATE.start_addflt_#res| 4294967295) .cse7) (and .cse11 .cse14 .cse8 .cse15 .cse16 .cse9 .cse12 .cse10 (<= 0 ULTIMATE.start_addflt_~b) .cse13 .cse17 .cse18))) [2020-12-23 01:39:50,693 INFO L185 CegarLoopUtils]: At program point L137-1(lines 75 139) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_addflt_~b ULTIMATE.start_main_~b~0)) (.cse1 (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_addflt_~b)) (.cse2 (<= ULTIMATE.start_addflt_~a ULTIMATE.start_main_~b~0)) (.cse3 (<= ULTIMATE.start_main_~b~0 ULTIMATE.start_addflt_~a)) (.cse4 (<= 4294967295 ULTIMATE.start_main_~r_add1~0)) (.cse5 (<= ULTIMATE.start_main_~r_add1~0 4294967295))) (or (and (<= ULTIMATE.start_main_~r_add1~0 (* 4294967296 (div ULTIMATE.start_main_~r_add1~0 4294967296))) (or (and .cse0 .cse1) (and .cse2 .cse3)) (<= ULTIMATE.start_addflt_~a (* 4294967296 (div ULTIMATE.start_addflt_~a 4294967296))) (<= ULTIMATE.start_addflt_~__retres10~0 (* 4294967296 (div ULTIMATE.start_addflt_~__retres10~0 4294967296))) (<= ULTIMATE.start_main_~b~0 (* 4294967296 (div ULTIMATE.start_main_~b~0 4294967296))) (<= |ULTIMATE.start_addflt_#res| (* 4294967296 (div |ULTIMATE.start_addflt_#res| 4294967296)))) (and (<= ULTIMATE.start_addflt_~__retres10~0 4294967295) (<= 4294967295 |ULTIMATE.start_addflt_#res|) .cse4 .cse5 (<= |ULTIMATE.start_addflt_#res| 4294967295) (<= 4294967295 ULTIMATE.start_addflt_~__retres10~0)) (let ((.cse6 (<= ULTIMATE.start_main_~r_add1~0 |ULTIMATE.start_addflt_#res|)) (.cse7 (<= ULTIMATE.start_main_~r_add1~0 ULTIMATE.start_addflt_~__retres10~0))) (and .cse6 .cse7 (<= ULTIMATE.start_addflt_~__retres10~0 ULTIMATE.start_main_~r_add1~0) (let ((.cse8 (or (and (= ULTIMATE.start_addflt_~__retres10~0 0) (= |ULTIMATE.start_addflt_#res| 0) (= |ULTIMATE.start_base2flt_#res| 0) (= ULTIMATE.start_base2flt_~__retres4~0 0) (= ULTIMATE.start_addflt_~a 0) (= ULTIMATE.start_main_~b~0 0)) (and .cse4 .cse5) (and .cse6 .cse7 (<= ULTIMATE.start_main_~r_add1~0 ULTIMATE.start_addflt_~a) (<= ULTIMATE.start_addflt_~a ULTIMATE.start_main_~r_add1~0))))) (or (and .cse0 .cse1 .cse8) (and .cse2 .cse3 .cse8))) (<= |ULTIMATE.start_addflt_#res| ULTIMATE.start_main_~r_add1~0))))) [2020-12-23 01:39:50,694 INFO L185 CegarLoopUtils]: At program point L71(lines 20 73) the Hoare annotation is: (and (<= 0 ULTIMATE.start_base2flt_~__retres4~0) (= ULTIMATE.start_base2flt_~m 0)) [2020-12-23 01:39:50,694 INFO L185 CegarLoopUtils]: At program point L71-1(lines 20 73) the Hoare annotation is: (or (and (<= ULTIMATE.start_base2flt_~__retres4~0 4294967295) (<= 4294967295 ULTIMATE.start_base2flt_~__retres4~0)) (and (<= 0 ULTIMATE.start_base2flt_~res~0) (<= 0 ULTIMATE.start_base2flt_~__retres4~0)) (= ULTIMATE.start_base2flt_~__retres4~0 0)) [2020-12-23 01:39:50,694 INFO L185 CegarLoopUtils]: At program point L71-2(lines 20 73) the Hoare annotation is: (or (and (<= ULTIMATE.start_base2flt_~__retres4~0 4294967295) (<= 4294967295 ULTIMATE.start_base2flt_~__retres4~0)) (and (<= 4294967295 ULTIMATE.start_main_~a~0) (<= ULTIMATE.start_main_~a~0 4294967295)) (= ULTIMATE.start_main_~a~0 0) (and (<= 0 ULTIMATE.start_base2flt_~res~0) (<= 0 ULTIMATE.start_base2flt_~__retres4~0)) (= ULTIMATE.start_base2flt_~__retres4~0 0)) [2020-12-23 01:39:50,694 INFO L189 CegarLoopUtils]: For program point L105(line 105) no Hoare annotation was computed. [2020-12-23 01:39:50,694 INFO L185 CegarLoopUtils]: At program point L72(lines 16 74) the Hoare annotation is: (and (<= 0 |ULTIMATE.start_base2flt_#res|) (<= 0 ULTIMATE.start_base2flt_~__retres4~0) (= ULTIMATE.start_base2flt_~m 0)) [2020-12-23 01:39:50,694 INFO L189 CegarLoopUtils]: For program point L39(lines 39 43) no Hoare annotation was computed. [2020-12-23 01:39:50,695 INFO L185 CegarLoopUtils]: At program point L72-1(lines 16 74) the Hoare annotation is: (or (and (<= ULTIMATE.start_base2flt_~__retres4~0 4294967295) (<= 4294967295 |ULTIMATE.start_base2flt_#res|) (<= |ULTIMATE.start_base2flt_#res| 4294967295) (<= 4294967295 ULTIMATE.start_base2flt_~__retres4~0)) (and (= |ULTIMATE.start_base2flt_#res| 0) (= ULTIMATE.start_base2flt_~__retres4~0 0)) (and (<= 0 |ULTIMATE.start_base2flt_#res|) (<= 0 ULTIMATE.start_base2flt_~res~0) (<= 0 ULTIMATE.start_base2flt_~__retres4~0))) [2020-12-23 01:39:50,695 INFO L189 CegarLoopUtils]: For program point L105-2(line 105) no Hoare annotation was computed. [2020-12-23 01:39:50,695 INFO L185 CegarLoopUtils]: At program point L39-1(lines 29 44) the Hoare annotation is: false [2020-12-23 01:39:50,695 INFO L185 CegarLoopUtils]: At program point L72-2(lines 16 74) the Hoare annotation is: (or (and (= |ULTIMATE.start_base2flt_#res| 0) (= ULTIMATE.start_base2flt_~__retres4~0 0)) (and (<= ULTIMATE.start_base2flt_~__retres4~0 4294967295) (<= 4294967295 |ULTIMATE.start_base2flt_#res|) (<= |ULTIMATE.start_base2flt_#res| 4294967295) (<= 4294967295 ULTIMATE.start_base2flt_~__retres4~0)) (and (<= 4294967295 ULTIMATE.start_main_~a~0) (<= ULTIMATE.start_main_~a~0 4294967295)) (= ULTIMATE.start_main_~a~0 0) (and (<= 0 |ULTIMATE.start_base2flt_#res|) (<= 0 ULTIMATE.start_base2flt_~res~0) (<= 0 ULTIMATE.start_base2flt_~__retres4~0))) [2020-12-23 01:39:50,695 INFO L189 CegarLoopUtils]: For program point L39-2(lines 39 43) no Hoare annotation was computed. [2020-12-23 01:39:50,695 INFO L189 CegarLoopUtils]: For program point L105-4(line 105) no Hoare annotation was computed. [2020-12-23 01:39:50,695 INFO L192 CegarLoopUtils]: At program point L39-3(lines 29 44) the Hoare annotation is: true [2020-12-23 01:39:50,696 INFO L189 CegarLoopUtils]: For program point L39-4(lines 39 43) no Hoare annotation was computed. [2020-12-23 01:39:50,696 INFO L189 CegarLoopUtils]: For program point L105-6(line 105) no Hoare annotation was computed. [2020-12-23 01:39:50,696 INFO L192 CegarLoopUtils]: At program point L39-5(lines 29 44) the Hoare annotation is: true [2020-12-23 01:39:50,696 INFO L189 CegarLoopUtils]: For program point L105-8(line 105) no Hoare annotation was computed. [2020-12-23 01:39:50,696 INFO L189 CegarLoopUtils]: For program point L105-9(line 105) no Hoare annotation was computed. [2020-12-23 01:39:50,696 INFO L189 CegarLoopUtils]: For program point L105-11(line 105) no Hoare annotation was computed. [2020-12-23 01:39:50,696 INFO L189 CegarLoopUtils]: For program point L105-13(line 105) no Hoare annotation was computed. [2020-12-23 01:39:50,696 INFO L189 CegarLoopUtils]: For program point L105-15(line 105) no Hoare annotation was computed. [2020-12-23 01:39:50,696 INFO L189 CegarLoopUtils]: For program point L105-17(line 105) no Hoare annotation was computed. [2020-12-23 01:39:50,697 INFO L189 CegarLoopUtils]: For program point L239(lines 239 248) no Hoare annotation was computed. [2020-12-23 01:39:50,697 INFO L189 CegarLoopUtils]: For program point L239-2(lines 239 248) no Hoare annotation was computed. [2020-12-23 01:39:50,697 INFO L189 CegarLoopUtils]: For program point L8(lines 8 10) no Hoare annotation was computed. [2020-12-23 01:39:50,697 INFO L185 CegarLoopUtils]: At program point L8-2(lines 7 12) the Hoare annotation is: false [2020-12-23 01:39:50,697 INFO L189 CegarLoopUtils]: For program point L8-3(lines 8 10) no Hoare annotation was computed. [2020-12-23 01:39:50,697 INFO L185 CegarLoopUtils]: At program point L8-5(lines 7 12) the Hoare annotation is: false [2020-12-23 01:39:50,697 INFO L189 CegarLoopUtils]: For program point L8-6(lines 8 10) no Hoare annotation was computed. [2020-12-23 01:39:50,697 INFO L185 CegarLoopUtils]: At program point L8-8(line 132) the Hoare annotation is: false [2020-12-23 01:39:50,698 INFO L189 CegarLoopUtils]: For program point L8-9(lines 8 10) no Hoare annotation was computed. [2020-12-23 01:39:50,698 INFO L185 CegarLoopUtils]: At program point L8-11(lines 7 12) the Hoare annotation is: false [2020-12-23 01:39:50,698 INFO L189 CegarLoopUtils]: For program point L8-12(lines 8 10) no Hoare annotation was computed. [2020-12-23 01:39:50,698 INFO L185 CegarLoopUtils]: At program point L8-14(lines 7 12) the Hoare annotation is: false [2020-12-23 01:39:50,698 INFO L189 CegarLoopUtils]: For program point L8-15(lines 8 10) no Hoare annotation was computed. [2020-12-23 01:39:50,698 INFO L185 CegarLoopUtils]: At program point L8-17(line 132) the Hoare annotation is: false [2020-12-23 01:39:50,698 INFO L189 CegarLoopUtils]: For program point L8-18(lines 8 10) no Hoare annotation was computed. [2020-12-23 01:39:50,698 INFO L192 CegarLoopUtils]: At program point L8-20(lines 7 12) the Hoare annotation is: true [2020-12-23 01:39:50,698 INFO L189 CegarLoopUtils]: For program point L9(line 9) no Hoare annotation was computed. [2020-12-23 01:39:50,698 INFO L189 CegarLoopUtils]: For program point L9-1(line 9) no Hoare annotation was computed. [2020-12-23 01:39:50,698 INFO L189 CegarLoopUtils]: For program point L9-2(line 9) no Hoare annotation was computed. [2020-12-23 01:39:50,699 INFO L189 CegarLoopUtils]: For program point L9-3(line 9) no Hoare annotation was computed. [2020-12-23 01:39:50,699 INFO L189 CegarLoopUtils]: For program point L9-4(line 9) no Hoare annotation was computed. [2020-12-23 01:39:50,699 INFO L189 CegarLoopUtils]: For program point L9-5(line 9) no Hoare annotation was computed. [2020-12-23 01:39:50,699 INFO L189 CegarLoopUtils]: For program point L9-6(line 9) no Hoare annotation was computed. [2020-12-23 01:39:50,699 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2020-12-23 01:39:50,699 INFO L189 CegarLoopUtils]: For program point L242(lines 242 246) no Hoare annotation was computed. [2020-12-23 01:39:50,699 INFO L189 CegarLoopUtils]: For program point L242-2(lines 242 246) no Hoare annotation was computed. [2020-12-23 01:39:50,699 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2020-12-23 01:39:50,699 INFO L189 CegarLoopUtils]: For program point L111(lines 111 116) no Hoare annotation was computed. [2020-12-23 01:39:50,699 INFO L189 CegarLoopUtils]: For program point L111-1(lines 111 116) no Hoare annotation was computed. [2020-12-23 01:39:50,699 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2020-12-23 01:39:50,700 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2020-12-23 01:39:50,700 INFO L185 CegarLoopUtils]: At program point L49-2(lines 49 64) the Hoare annotation is: false [2020-12-23 01:39:50,700 INFO L192 CegarLoopUtils]: At program point L49-5(lines 49 64) the Hoare annotation is: true [2020-12-23 01:39:50,700 INFO L192 CegarLoopUtils]: At program point L49-8(lines 49 64) the Hoare annotation is: true [2020-12-23 01:39:50,700 INFO L189 CegarLoopUtils]: For program point L50(lines 49 64) no Hoare annotation was computed. [2020-12-23 01:39:50,700 INFO L189 CegarLoopUtils]: For program point L50-1(lines 49 64) no Hoare annotation was computed. [2020-12-23 01:39:50,700 INFO L189 CegarLoopUtils]: For program point L50-2(lines 49 64) no Hoare annotation was computed. [2020-12-23 01:39:50,700 INFO L189 CegarLoopUtils]: For program point L51(lines 49 64) no Hoare annotation was computed. [2020-12-23 01:39:50,700 INFO L189 CegarLoopUtils]: For program point L51-1(lines 49 64) no Hoare annotation was computed. [2020-12-23 01:39:50,701 INFO L189 CegarLoopUtils]: For program point L51-2(lines 49 64) no Hoare annotation was computed. [2020-12-23 01:39:50,701 INFO L189 CegarLoopUtils]: For program point L118(lines 118 129) no Hoare annotation was computed. [2020-12-23 01:39:50,701 INFO L189 CegarLoopUtils]: For program point L118-2(lines 118 129) no Hoare annotation was computed. [2020-12-23 01:39:50,701 INFO L189 CegarLoopUtils]: For program point L118-3(lines 118 129) no Hoare annotation was computed. [2020-12-23 01:39:50,701 INFO L189 CegarLoopUtils]: For program point L118-5(lines 118 129) no Hoare annotation was computed. [2020-12-23 01:39:50,701 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-12-23 01:39:50,701 INFO L189 CegarLoopUtils]: For program point L119(lines 119 124) no Hoare annotation was computed. [2020-12-23 01:39:50,701 INFO L189 CegarLoopUtils]: For program point L86(lines 86 92) no Hoare annotation was computed. [2020-12-23 01:39:50,702 INFO L189 CegarLoopUtils]: For program point L119-1(lines 119 124) no Hoare annotation was computed. [2020-12-23 01:39:50,702 INFO L189 CegarLoopUtils]: For program point L86-2(lines 85 138) no Hoare annotation was computed. [2020-12-23 01:39:50,702 INFO L189 CegarLoopUtils]: For program point L86-3(lines 86 92) no Hoare annotation was computed. [2020-12-23 01:39:50,702 INFO L189 CegarLoopUtils]: For program point L86-5(lines 85 138) no Hoare annotation was computed. [2020-12-23 01:39:50,702 INFO L189 CegarLoopUtils]: For program point L21(lines 21 26) no Hoare annotation was computed. [2020-12-23 01:39:50,702 INFO L189 CegarLoopUtils]: For program point L21-1(lines 21 26) no Hoare annotation was computed. [2020-12-23 01:39:50,702 INFO L189 CegarLoopUtils]: For program point L21-2(lines 21 26) no Hoare annotation was computed. [2020-12-23 01:39:50,702 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2020-12-23 01:39:50,702 INFO L192 CegarLoopUtils]: At program point L253(lines 217 255) the Hoare annotation is: true [2020-12-23 01:39:50,702 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-12-23 01:39:50,702 INFO L189 CegarLoopUtils]: For program point L27(lines 27 67) no Hoare annotation was computed. [2020-12-23 01:39:50,702 INFO L189 CegarLoopUtils]: For program point L27-1(lines 27 67) no Hoare annotation was computed. [2020-12-23 01:39:50,702 INFO L189 CegarLoopUtils]: For program point L27-2(lines 27 67) no Hoare annotation was computed. [2020-12-23 01:39:50,703 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-12-23 01:39:50,703 INFO L189 CegarLoopUtils]: For program point L30(lines 29 44) no Hoare annotation was computed. [2020-12-23 01:39:50,703 INFO L189 CegarLoopUtils]: For program point L30-1(lines 29 44) no Hoare annotation was computed. [2020-12-23 01:39:50,703 INFO L189 CegarLoopUtils]: For program point L30-2(lines 29 44) no Hoare annotation was computed. [2020-12-23 01:39:50,703 INFO L185 CegarLoopUtils]: At program point L65(lines 20 73) the Hoare annotation is: false [2020-12-23 01:39:50,703 INFO L192 CegarLoopUtils]: At program point L65-1(lines 20 73) the Hoare annotation is: true [2020-12-23 01:39:50,703 INFO L189 CegarLoopUtils]: For program point L-1(line -1) no Hoare annotation was computed. [2020-12-23 01:39:50,703 INFO L192 CegarLoopUtils]: At program point L65-2(lines 20 73) the Hoare annotation is: true [2020-12-23 01:39:50,704 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2020-12-23 01:39:50,704 INFO L189 CegarLoopUtils]: For program point L132-1(line 132) no Hoare annotation was computed. [2020-12-23 01:39:50,704 INFO L189 CegarLoopUtils]: For program point L132-3(line 132) no Hoare annotation was computed. [2020-12-23 01:39:50,704 INFO L189 CegarLoopUtils]: For program point L132-5(line 132) no Hoare annotation was computed. [2020-12-23 01:39:50,704 INFO L189 CegarLoopUtils]: For program point L132-7(lines 130 134) no Hoare annotation was computed. [2020-12-23 01:39:50,704 INFO L189 CegarLoopUtils]: For program point L132-9(line 132) no Hoare annotation was computed. [2020-12-23 01:39:50,704 INFO L189 CegarLoopUtils]: For program point L132-11(line 132) no Hoare annotation was computed. [2020-12-23 01:39:50,704 INFO L189 CegarLoopUtils]: For program point L132-13(line 132) no Hoare annotation was computed. [2020-12-23 01:39:50,704 INFO L189 CegarLoopUtils]: For program point L132-15(lines 130 134) no Hoare annotation was computed. [2020-12-23 01:39:50,705 INFO L189 CegarLoopUtils]: For program point L100(line 100) no Hoare annotation was computed. [2020-12-23 01:39:50,705 INFO L189 CegarLoopUtils]: For program point L133-1(line 133) no Hoare annotation was computed. [2020-12-23 01:39:50,705 INFO L189 CegarLoopUtils]: For program point L100-2(line 100) no Hoare annotation was computed. [2020-12-23 01:39:50,705 INFO L189 CegarLoopUtils]: For program point L133-3(line 133) no Hoare annotation was computed. [2020-12-23 01:39:50,705 INFO L189 CegarLoopUtils]: For program point L100-4(line 100) no Hoare annotation was computed. [2020-12-23 01:39:50,705 INFO L189 CegarLoopUtils]: For program point L133-5(line 133) no Hoare annotation was computed. [2020-12-23 01:39:50,705 INFO L189 CegarLoopUtils]: For program point L100-6(line 100) no Hoare annotation was computed. [2020-12-23 01:39:50,705 INFO L189 CegarLoopUtils]: For program point L133-7(line 133) no Hoare annotation was computed. [2020-12-23 01:39:50,705 INFO L189 CegarLoopUtils]: For program point L100-8(line 100) no Hoare annotation was computed. [2020-12-23 01:39:50,706 INFO L189 CegarLoopUtils]: For program point L133-9(line 133) no Hoare annotation was computed. [2020-12-23 01:39:50,706 INFO L189 CegarLoopUtils]: For program point L100-9(line 100) no Hoare annotation was computed. [2020-12-23 01:39:50,706 INFO L189 CegarLoopUtils]: For program point L133-11(line 133) no Hoare annotation was computed. [2020-12-23 01:39:50,706 INFO L189 CegarLoopUtils]: For program point L100-11(line 100) no Hoare annotation was computed. [2020-12-23 01:39:50,706 INFO L189 CegarLoopUtils]: For program point L133-13(line 133) no Hoare annotation was computed. [2020-12-23 01:39:50,706 INFO L189 CegarLoopUtils]: For program point L100-13(line 100) no Hoare annotation was computed. [2020-12-23 01:39:50,706 INFO L189 CegarLoopUtils]: For program point L133-15(line 133) no Hoare annotation was computed. [2020-12-23 01:39:50,706 INFO L189 CegarLoopUtils]: For program point L100-15(line 100) no Hoare annotation was computed. [2020-12-23 01:39:50,706 INFO L189 CegarLoopUtils]: For program point L100-17(line 100) no Hoare annotation was computed. [2020-12-23 01:39:50,706 INFO L189 CegarLoopUtils]: For program point L68-1(line 68) no Hoare annotation was computed. [2020-12-23 01:39:50,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.12 01:39:50 BoogieIcfgContainer [2020-12-23 01:39:50,777 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-23 01:39:50,778 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-23 01:39:50,778 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-23 01:39:50,778 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-23 01:39:50,782 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 01:39:24" (3/4) ... [2020-12-23 01:39:50,786 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-12-23 01:39:50,833 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2020-12-23 01:39:50,834 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2020-12-23 01:39:50,835 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-23 01:39:50,836 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-23 01:39:50,871 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (0 <= \result && 0 <= __retres4) && m == 0 [2020-12-23 01:39:50,873 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((__retres4 <= 4294967295 && 4294967295 <= \result) && \result <= 4294967295) && 4294967295 <= __retres4) || (\result == 0 && __retres4 == 0)) || ((0 <= \result && 0 <= res) && 0 <= __retres4) [2020-12-23 01:39:50,874 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\result == 0 && __retres4 == 0) || (((__retres4 <= 4294967295 && 4294967295 <= \result) && \result <= 4294967295) && 4294967295 <= __retres4)) || (4294967295 <= a && a <= 4294967295)) || a == 0) || ((0 <= \result && 0 <= res) && 0 <= __retres4) [2020-12-23 01:39:50,876 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((__retres10 == 0 && b <= b) && b <= b) && a == 0) && b <= 4294967296 * (b / 4294967296)) && a == 0) || (((((((__retres4 <= 4294967295 && 4294967295 <= \result) && \result <= 4294967295) && a <= 4294967295) && b <= a) && 4294967295 <= __retres4) && 4294967295 <= __retres10) && __retres10 <= b)) || ((((b <= __retres10 && a <= b) && a == 0) && b <= a) && __retres10 <= b)) || ((((((((b <= __retres10 && 0 <= \result) && a <= b) && 0 <= res) && 0 <= b) && b <= a) && __retres10 <= b) && 0 <= __retres4) && a <= 4294967296 * ((a + -1) / 4294967296) + 4294967295)) || ((((((a == a && __retres10 <= a) && a <= __retres10) && \result == 0) && b == 0) && __retres4 == 0) && b == 0)) || ((((((__retres10 <= 4294967295 && a == a) && 4294967295 <= a) && b <= b) && a <= 4294967295) && b <= b) && 4294967295 <= __retres10)) || (((((((((0 <= \result && a == a) && b <= b) && __retres10 <= a) && a <= __retres10) && b <= b) && 0 <= res) && b <= 4294967296 * (b / 4294967296)) && 0 <= b) && 0 <= __retres4) [2020-12-23 01:39:50,876 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((b <= __retres10 && a <= b) && a == 0) && \result <= b) && b <= \result) && b <= a) && __retres10 <= b) || (((((((((__retres4 <= 4294967295 && 4294967295 <= \result) && \result <= b) && \result <= 4294967295) && a <= 4294967295) && b <= \result) && b <= a) && 4294967295 <= __retres4) && 4294967295 <= __retres10) && __retres10 <= b)) || ((((((__retres10 == 0 && \result == 0) && b <= b) && b <= b) && a == 0) && b <= 4294967296 * (b / 4294967296)) && a == 0)) || ((((((((((0 <= \result && b <= __retres10) && a <= b) && 0 <= res) && \result <= b) && 0 <= b) && b <= \result) && b <= a) && __retres10 <= b) && 0 <= __retres4) && a <= 4294967296 * ((a + -1) / 4294967296) + 4294967295)) || ((((((((a == a && __retres10 <= a) && a <= __retres10) && \result == 0) && b == 0) && __retres4 == 0) && a <= \result) && \result <= a) && b == 0)) || (((((((a == a && 4294967295 <= \result) && b <= b) && __retres10 <= a) && a <= 4294967295) && b <= b) && \result <= 4294967295) && 4294967295 <= __retres10)) || (((((((((((0 <= \result && a == a) && b <= b) && __retres10 <= a) && a <= __retres10) && b <= b) && 0 <= res) && b <= 4294967296 * (b / 4294967296)) && 0 <= b) && 0 <= __retres4) && a <= \result) && \result <= a) [2020-12-23 01:39:50,878 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((r_add1 <= 4294967296 * (r_add1 / 4294967296) && ((b <= b && b <= b) || (a <= b && b <= a))) && a <= 4294967296 * (a / 4294967296)) && __retres10 <= 4294967296 * (__retres10 / 4294967296)) && b <= 4294967296 * (b / 4294967296)) && \result <= 4294967296 * (\result / 4294967296)) || (((((__retres10 <= 4294967295 && 4294967295 <= \result) && 4294967295 <= r_add1) && r_add1 <= 4294967295) && \result <= 4294967295) && 4294967295 <= __retres10)) || ((((r_add1 <= \result && r_add1 <= __retres10) && __retres10 <= r_add1) && (((b <= b && b <= b) && (((((((__retres10 == 0 && \result == 0) && \result == 0) && __retres4 == 0) && a == 0) && b == 0) || (4294967295 <= r_add1 && r_add1 <= 4294967295)) || (((r_add1 <= \result && r_add1 <= __retres10) && r_add1 <= a) && a <= r_add1))) || ((a <= b && b <= a) && (((((((__retres10 == 0 && \result == 0) && \result == 0) && __retres4 == 0) && a == 0) && b == 0) || (4294967295 <= r_add1 && r_add1 <= 4294967295)) || (((r_add1 <= \result && r_add1 <= __retres10) && r_add1 <= a) && a <= r_add1))))) && \result <= r_add1) [2020-12-23 01:39:50,961 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/bitvector/soft_float_4-3a.c.cil.c-witness.graphml [2020-12-23 01:39:50,961 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-23 01:39:50,962 INFO L168 Benchmark]: Toolchain (without parser) took 27735.41 ms. Allocated memory was 151.0 MB in the beginning and 314.6 MB in the end (delta: 163.6 MB). Free memory was 125.9 MB in the beginning and 270.6 MB in the end (delta: -144.7 MB). Peak memory consumption was 19.4 MB. Max. memory is 8.0 GB. [2020-12-23 01:39:50,963 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 151.0 MB. Free memory is still 125.0 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-12-23 01:39:50,963 INFO L168 Benchmark]: CACSL2BoogieTranslator took 514.88 ms. Allocated memory is still 151.0 MB. Free memory was 125.7 MB in the beginning and 112.4 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2020-12-23 01:39:50,964 INFO L168 Benchmark]: Boogie Procedure Inliner took 110.11 ms. Allocated memory is still 151.0 MB. Free memory was 112.2 MB in the beginning and 108.8 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-12-23 01:39:50,964 INFO L168 Benchmark]: Boogie Preprocessor took 52.76 ms. Allocated memory is still 151.0 MB. Free memory was 108.8 MB in the beginning and 106.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-12-23 01:39:50,964 INFO L168 Benchmark]: RCFGBuilder took 1041.98 ms. Allocated memory is still 151.0 MB. Free memory was 106.1 MB in the beginning and 84.3 MB in the end (delta: 21.8 MB). Peak memory consumption was 21.1 MB. Max. memory is 8.0 GB. [2020-12-23 01:39:50,965 INFO L168 Benchmark]: TraceAbstraction took 25817.82 ms. Allocated memory was 151.0 MB in the beginning and 314.6 MB in the end (delta: 163.6 MB). Free memory was 83.8 MB in the beginning and 281.1 MB in the end (delta: -197.3 MB). Peak memory consumption was 143.6 MB. Max. memory is 8.0 GB. [2020-12-23 01:39:50,965 INFO L168 Benchmark]: Witness Printer took 183.19 ms. Allocated memory is still 314.6 MB. Free memory was 281.1 MB in the beginning and 270.6 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. [2020-12-23 01:39:50,968 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.19 ms. Allocated memory is still 151.0 MB. Free memory is still 125.0 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 514.88 ms. Allocated memory is still 151.0 MB. Free memory was 125.7 MB in the beginning and 112.4 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 110.11 ms. Allocated memory is still 151.0 MB. Free memory was 112.2 MB in the beginning and 108.8 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 52.76 ms. Allocated memory is still 151.0 MB. Free memory was 108.8 MB in the beginning and 106.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1041.98 ms. Allocated memory is still 151.0 MB. Free memory was 106.1 MB in the beginning and 84.3 MB in the end (delta: 21.8 MB). Peak memory consumption was 21.1 MB. Max. memory is 8.0 GB. * TraceAbstraction took 25817.82 ms. Allocated memory was 151.0 MB in the beginning and 314.6 MB in the end (delta: 163.6 MB). Free memory was 83.8 MB in the beginning and 281.1 MB in the end (delta: -197.3 MB). Peak memory consumption was 143.6 MB. Max. memory is 8.0 GB. * Witness Printer took 183.19 ms. Allocated memory is still 314.6 MB. Free memory was 281.1 MB in the beginning and 270.6 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 9]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 9]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 9]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 9]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 9]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 9]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 9]: 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 7 specifications checked. All of them hold - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: ((((__retres4 <= 4294967295 && 4294967295 <= __retres4) || (4294967295 <= a && a <= 4294967295)) || a == 0) || (0 <= res && 0 <= __retres4)) || __retres4 == 0 - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: ((__retres4 <= 4294967295 && 4294967295 <= __retres4) || (0 <= res && 0 <= __retres4)) || __retres4 == 0 - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 0 <= __retres4 && m == 0 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: ((((((r_add1 <= 4294967296 * (r_add1 / 4294967296) && ((b <= b && b <= b) || (a <= b && b <= a))) && a <= 4294967296 * (a / 4294967296)) && __retres10 <= 4294967296 * (__retres10 / 4294967296)) && b <= 4294967296 * (b / 4294967296)) && \result <= 4294967296 * (\result / 4294967296)) || (((((__retres10 <= 4294967295 && 4294967295 <= \result) && 4294967295 <= r_add1) && r_add1 <= 4294967295) && \result <= 4294967295) && 4294967295 <= __retres10)) || ((((r_add1 <= \result && r_add1 <= __retres10) && __retres10 <= r_add1) && (((b <= b && b <= b) && (((((((__retres10 == 0 && \result == 0) && \result == 0) && __retres4 == 0) && a == 0) && b == 0) || (4294967295 <= r_add1 && r_add1 <= 4294967295)) || (((r_add1 <= \result && r_add1 <= __retres10) && r_add1 <= a) && a <= r_add1))) || ((a <= b && b <= a) && (((((((__retres10 == 0 && \result == 0) && \result == 0) && __retres4 == 0) && a == 0) && b == 0) || (4294967295 <= r_add1 && r_add1 <= 4294967295)) || (((r_add1 <= \result && r_add1 <= __retres10) && r_add1 <= a) && a <= r_add1))))) && \result <= r_add1) - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: (((((((((((b <= __retres10 && a <= b) && a == 0) && \result <= b) && b <= \result) && b <= a) && __retres10 <= b) || (((((((((__retres4 <= 4294967295 && 4294967295 <= \result) && \result <= b) && \result <= 4294967295) && a <= 4294967295) && b <= \result) && b <= a) && 4294967295 <= __retres4) && 4294967295 <= __retres10) && __retres10 <= b)) || ((((((__retres10 == 0 && \result == 0) && b <= b) && b <= b) && a == 0) && b <= 4294967296 * (b / 4294967296)) && a == 0)) || ((((((((((0 <= \result && b <= __retres10) && a <= b) && 0 <= res) && \result <= b) && 0 <= b) && b <= \result) && b <= a) && __retres10 <= b) && 0 <= __retres4) && a <= 4294967296 * ((a + -1) / 4294967296) + 4294967295)) || ((((((((a == a && __retres10 <= a) && a <= __retres10) && \result == 0) && b == 0) && __retres4 == 0) && a <= \result) && \result <= a) && b == 0)) || (((((((a == a && 4294967295 <= \result) && b <= b) && __retres10 <= a) && a <= 4294967295) && b <= b) && \result <= 4294967295) && 4294967295 <= __retres10)) || (((((((((((0 <= \result && a == a) && b <= b) && __retres10 <= a) && a <= __retres10) && b <= b) && 0 <= res) && b <= 4294967296 * (b / 4294967296)) && 0 <= b) && 0 <= __retres4) && a <= \result) && \result <= a) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: ((((\result == 0 && __retres4 == 0) || (((__retres4 <= 4294967295 && 4294967295 <= \result) && \result <= 4294967295) && 4294967295 <= __retres4)) || (4294967295 <= a && a <= 4294967295)) || a == 0) || ((0 <= \result && 0 <= res) && 0 <= __retres4) - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: ((((__retres4 <= 4294967295 && 4294967295 <= \result) && \result <= 4294967295) && 4294967295 <= __retres4) || (\result == 0 && __retres4 == 0)) || ((0 <= \result && 0 <= res) && 0 <= __retres4) - InvariantResult [Line: 85]: Loop Invariant Derived loop invariant: (((r_add1 <= __retres10 && __retres10 <= r_add1) && ((((b <= b && b <= b) && r_add1 <= a) && a <= r_add1) || (((a <= b && b <= a) && r_add1 <= a) && a <= r_add1))) || (((__retres10 <= 4294967295 && 4294967295 <= r_add1) && r_add1 <= 4294967295) && 4294967295 <= __retres10)) || ((((r_add1 <= 4294967296 * (r_add1 / 4294967296) && ((b <= b && b <= b) || (a <= b && b <= a))) && a <= 4294967296 * (a / 4294967296)) && __retres10 <= 4294967296 * (__retres10 / 4294967296)) && b <= 4294967296 * (b / 4294967296)) - InvariantResult [Line: 217]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: (0 <= \result && 0 <= __retres4) && m == 0 - InvariantResult [Line: 85]: Loop Invariant Derived loop invariant: ((((((((((__retres10 == 0 && b <= b) && b <= b) && a == 0) && b <= 4294967296 * (b / 4294967296)) && a == 0) || (((((((__retres4 <= 4294967295 && 4294967295 <= \result) && \result <= 4294967295) && a <= 4294967295) && b <= a) && 4294967295 <= __retres4) && 4294967295 <= __retres10) && __retres10 <= b)) || ((((b <= __retres10 && a <= b) && a == 0) && b <= a) && __retres10 <= b)) || ((((((((b <= __retres10 && 0 <= \result) && a <= b) && 0 <= res) && 0 <= b) && b <= a) && __retres10 <= b) && 0 <= __retres4) && a <= 4294967296 * ((a + -1) / 4294967296) + 4294967295)) || ((((((a == a && __retres10 <= a) && a <= __retres10) && \result == 0) && b == 0) && __retres4 == 0) && b == 0)) || ((((((__retres10 <= 4294967295 && a == a) && 4294967295 <= a) && b <= b) && a <= 4294967295) && b <= b) && 4294967295 <= __retres10)) || (((((((((0 <= \result && a == a) && b <= b) && __retres10 <= a) && a <= __retres10) && b <= b) && 0 <= res) && b <= 4294967296 * (b / 4294967296)) && 0 <= b) && 0 <= __retres4) - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 164 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 16.9s, OverallIterations: 29, TraceHistogramMax: 1, AutomataDifference: 11.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 8.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 8684 SDtfs, 10798 SDslu, 42215 SDs, 0 SdLazy, 5844 SolverSat, 446 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 473 GetRequests, 88 SyntacticMatches, 4 SemanticMatches, 381 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 902 ImplicationChecksByTransitivity, 5.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=735occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 29 MinimizatonAttempts, 5439 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 27 LocationsWithAnnotation, 27 PreInvPairs, 121 NumberOfFragments, 819 HoareAnnotationTreeSize, 27 FomulaSimplifications, 47107100062 FormulaSimplificationTreeSizeReduction, 2.5s HoareSimplificationTime, 27 FomulaSimplificationsInter, 2361500559 FormulaSimplificationTreeSizeReductionInter, 6.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 880 NumberOfCodeBlocks, 880 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 851 ConstructedInterpolants, 0 QuantifiedInterpolants, 70645 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...