/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/eca-rers2012/Problem14_label19.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 04:19:06,560 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 04:19:06,563 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 04:19:06,618 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 04:19:06,620 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 04:19:06,626 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 04:19:06,632 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 04:19:06,639 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 04:19:06,643 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 04:19:06,651 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 04:19:06,656 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 04:19:06,659 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 04:19:06,659 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 04:19:06,664 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 04:19:06,667 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 04:19:06,669 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 04:19:06,689 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 04:19:06,691 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 04:19:06,693 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 04:19:06,698 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 04:19:06,702 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 04:19:06,705 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 04:19:06,707 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 04:19:06,710 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 04:19:06,716 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 04:19:06,721 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 04:19:06,721 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 04:19:06,723 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 04:19:06,727 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 04:19:06,728 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 04:19:06,729 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 04:19:06,730 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 04:19:06,733 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 04:19:06,734 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 04:19:06,736 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 04:19:06,736 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 04:19:06,738 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 04:19:06,747 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 04:19:06,748 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 04:19:06,750 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 04:19:06,751 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 04:19:06,757 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 04:19:06,809 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 04:19:06,809 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 04:19:06,814 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 04:19:06,814 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 04:19:06,815 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 04:19:06,815 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 04:19:06,815 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 04:19:06,815 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 04:19:06,816 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 04:19:06,816 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 04:19:06,817 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 04:19:06,817 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 04:19:06,818 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 04:19:06,818 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 04:19:06,818 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 04:19:06,818 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 04:19:06,819 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 04:19:06,819 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 04:19:06,819 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 04:19:06,819 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 04:19:06,820 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 04:19:06,820 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 04:19:06,820 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 04:19:06,820 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 04:19:06,821 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 04:19:06,821 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 04:19:07,340 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 04:19:07,383 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 04:19:07,387 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 04:19:07,388 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 04:19:07,389 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 04:19:07,391 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem14_label19.c [2020-12-23 04:19:07,510 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/e38484e3a/60550a0b6da5407b9574675dc0d8fab6/FLAGaf3270027 [2020-12-23 04:19:08,555 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 04:19:08,556 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label19.c [2020-12-23 04:19:08,573 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/e38484e3a/60550a0b6da5407b9574675dc0d8fab6/FLAGaf3270027 [2020-12-23 04:19:08,741 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/e38484e3a/60550a0b6da5407b9574675dc0d8fab6 [2020-12-23 04:19:08,746 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 04:19:08,749 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 04:19:08,754 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 04:19:08,755 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 04:19:08,760 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 04:19:08,761 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 04:19:08" (1/1) ... [2020-12-23 04:19:08,764 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d5fd806 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:19:08, skipping insertion in model container [2020-12-23 04:19:08,765 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 04:19:08" (1/1) ... [2020-12-23 04:19:08,776 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 04:19:08,870 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-23 04:19:09,237 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/eca-rers2012/Problem14_label19.c[6323,6336] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a24~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a24~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a24~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a24~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a24~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a24~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~input~0,] left hand side expression in assignment: lhs: VariableLHS[~output~0,] [2020-12-23 04:19:09,480 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 04:19:09,498 INFO L203 MainTranslator]: Completed pre-run [2020-12-23 04:19:09,562 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/eca-rers2012/Problem14_label19.c[6323,6336] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a24~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a24~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a24~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a24~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a24~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a24~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a15~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a21~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~input~0,] left hand side expression in assignment: lhs: VariableLHS[~output~0,] [2020-12-23 04:19:09,780 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 04:19:09,803 INFO L208 MainTranslator]: Completed translation [2020-12-23 04:19:09,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:19:09 WrapperNode [2020-12-23 04:19:09,804 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 04:19:09,807 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 04:19:09,807 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 04:19:09,807 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 04:19:09,816 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:19:09" (1/1) ... [2020-12-23 04:19:09,860 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:19:09" (1/1) ... [2020-12-23 04:19:09,975 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 04:19:09,978 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 04:19:09,979 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 04:19:09,979 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 04:19:09,991 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:19:09" (1/1) ... [2020-12-23 04:19:09,992 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:19:09" (1/1) ... [2020-12-23 04:19:10,004 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:19:09" (1/1) ... [2020-12-23 04:19:10,005 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:19:09" (1/1) ... [2020-12-23 04:19:10,063 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:19:09" (1/1) ... [2020-12-23 04:19:10,082 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:19:09" (1/1) ... [2020-12-23 04:19:10,101 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:19:09" (1/1) ... [2020-12-23 04:19:10,115 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 04:19:10,116 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 04:19:10,117 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 04:19:10,117 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 04:19:10,118 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:19:09" (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 04:19:10,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 04:19:10,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 04:19:10,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 04:19:10,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 04:19:12,095 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 04:19:12,095 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2020-12-23 04:19:12,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 04:19:12 BoogieIcfgContainer [2020-12-23 04:19:12,101 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 04:19:12,104 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 04:19:12,105 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 04:19:12,109 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 04:19:12,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 04:19:08" (1/3) ... [2020-12-23 04:19:12,111 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cae1c67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 04:19:12, skipping insertion in model container [2020-12-23 04:19:12,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 04:19:09" (2/3) ... [2020-12-23 04:19:12,112 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cae1c67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 04:19:12, skipping insertion in model container [2020-12-23 04:19:12,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 04:19:12" (3/3) ... [2020-12-23 04:19:12,114 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem14_label19.c [2020-12-23 04:19:12,122 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 04:19:12,127 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-23 04:19:12,147 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-23 04:19:12,180 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 04:19:12,180 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 04:19:12,180 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 04:19:12,181 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 04:19:12,181 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 04:19:12,181 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 04:19:12,181 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 04:19:12,181 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 04:19:12,204 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states. [2020-12-23 04:19:12,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-12-23 04:19:12,214 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:19:12,215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 04:19:12,216 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:19:12,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:19:12,222 INFO L82 PathProgramCache]: Analyzing trace with hash 531730986, now seen corresponding path program 1 times [2020-12-23 04:19:12,233 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:19:12,233 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100989871] [2020-12-23 04:19:12,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:19:12,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:19:12,718 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 04:19:12,720 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100989871] [2020-12-23 04:19:12,721 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 04:19:12,721 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 04:19:12,722 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135025336] [2020-12-23 04:19:12,727 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 04:19:12,728 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:19:12,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 04:19:12,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 04:19:12,750 INFO L87 Difference]: Start difference. First operand 245 states. Second operand 4 states. [2020-12-23 04:19:15,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:19:15,051 INFO L93 Difference]: Finished difference Result 850 states and 1558 transitions. [2020-12-23 04:19:15,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 04:19:15,054 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2020-12-23 04:19:15,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:19:15,075 INFO L225 Difference]: With dead ends: 850 [2020-12-23 04:19:15,075 INFO L226 Difference]: Without dead ends: 538 [2020-12-23 04:19:15,083 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 04:19:15,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2020-12-23 04:19:15,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2020-12-23 04:19:15,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2020-12-23 04:19:15,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 778 transitions. [2020-12-23 04:19:15,208 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 778 transitions. Word has length 62 [2020-12-23 04:19:15,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:19:15,209 INFO L481 AbstractCegarLoop]: Abstraction has 538 states and 778 transitions. [2020-12-23 04:19:15,209 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 04:19:15,209 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 778 transitions. [2020-12-23 04:19:15,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2020-12-23 04:19:15,221 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:19:15,222 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 04:19:15,222 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 04:19:15,222 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:19:15,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:19:15,223 INFO L82 PathProgramCache]: Analyzing trace with hash -56024554, now seen corresponding path program 1 times [2020-12-23 04:19:15,223 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:19:15,224 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575247659] [2020-12-23 04:19:15,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:19:15,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:19:15,594 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 04:19:15,594 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575247659] [2020-12-23 04:19:15,594 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 04:19:15,595 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 04:19:15,596 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256659876] [2020-12-23 04:19:15,600 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 04:19:15,601 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:19:15,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 04:19:15,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 04:19:15,602 INFO L87 Difference]: Start difference. First operand 538 states and 778 transitions. Second operand 4 states. [2020-12-23 04:19:16,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:19:16,947 INFO L93 Difference]: Finished difference Result 1283 states and 1979 transitions. [2020-12-23 04:19:16,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 04:19:16,948 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2020-12-23 04:19:16,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:19:16,955 INFO L225 Difference]: With dead ends: 1283 [2020-12-23 04:19:16,956 INFO L226 Difference]: Without dead ends: 896 [2020-12-23 04:19:16,959 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 04:19:16,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2020-12-23 04:19:17,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 894. [2020-12-23 04:19:17,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 894 states. [2020-12-23 04:19:17,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1057 transitions. [2020-12-23 04:19:17,015 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1057 transitions. Word has length 142 [2020-12-23 04:19:17,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:19:17,016 INFO L481 AbstractCegarLoop]: Abstraction has 894 states and 1057 transitions. [2020-12-23 04:19:17,016 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 04:19:17,016 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1057 transitions. [2020-12-23 04:19:17,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2020-12-23 04:19:17,020 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:19:17,021 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 04:19:17,021 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 04:19:17,021 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:19:17,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:19:17,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1675654197, now seen corresponding path program 1 times [2020-12-23 04:19:17,023 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:19:17,023 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156663733] [2020-12-23 04:19:17,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:19:17,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:19:17,396 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 119 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 04:19:17,397 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156663733] [2020-12-23 04:19:17,397 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722131559] [2020-12-23 04:19:17,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 04:19:17,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:19:17,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-23 04:19:17,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 04:19:18,054 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2020-12-23 04:19:18,054 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 04:19:18,056 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2020-12-23 04:19:18,058 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534689194] [2020-12-23 04:19:18,060 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 04:19:18,061 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:19:18,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 04:19:18,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-23 04:19:18,064 INFO L87 Difference]: Start difference. First operand 894 states and 1057 transitions. Second operand 3 states. [2020-12-23 04:19:18,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:19:18,893 INFO L93 Difference]: Finished difference Result 1964 states and 2439 transitions. [2020-12-23 04:19:18,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 04:19:18,895 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2020-12-23 04:19:18,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:19:18,909 INFO L225 Difference]: With dead ends: 1964 [2020-12-23 04:19:18,909 INFO L226 Difference]: Without dead ends: 1250 [2020-12-23 04:19:18,911 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-23 04:19:18,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2020-12-23 04:19:18,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1250. [2020-12-23 04:19:18,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1250 states. [2020-12-23 04:19:18,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1484 transitions. [2020-12-23 04:19:18,962 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1484 transitions. Word has length 233 [2020-12-23 04:19:18,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:19:18,965 INFO L481 AbstractCegarLoop]: Abstraction has 1250 states and 1484 transitions. [2020-12-23 04:19:18,965 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 04:19:18,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1484 transitions. [2020-12-23 04:19:18,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2020-12-23 04:19:18,971 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:19:18,971 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 04:19:19,184 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-12-23 04:19:19,185 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:19:19,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:19:19,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1903372100, now seen corresponding path program 1 times [2020-12-23 04:19:19,187 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:19:19,188 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153923652] [2020-12-23 04:19:19,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:19:19,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:19:19,812 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 119 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 04:19:19,814 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153923652] [2020-12-23 04:19:19,815 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860281274] [2020-12-23 04:19:19,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 04:19:19,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:19:19,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-23 04:19:19,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 04:19:20,318 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2020-12-23 04:19:20,319 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 04:19:20,319 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2020-12-23 04:19:20,319 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717180270] [2020-12-23 04:19:20,320 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 04:19:20,320 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:19:20,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 04:19:20,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-23 04:19:20,322 INFO L87 Difference]: Start difference. First operand 1250 states and 1484 transitions. Second operand 3 states. [2020-12-23 04:19:21,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:19:21,097 INFO L93 Difference]: Finished difference Result 2854 states and 3398 transitions. [2020-12-23 04:19:21,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 04:19:21,098 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 236 [2020-12-23 04:19:21,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:19:21,107 INFO L225 Difference]: With dead ends: 2854 [2020-12-23 04:19:21,108 INFO L226 Difference]: Without dead ends: 1606 [2020-12-23 04:19:21,111 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-23 04:19:21,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2020-12-23 04:19:21,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1428. [2020-12-23 04:19:21,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1428 states. [2020-12-23 04:19:21,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 1663 transitions. [2020-12-23 04:19:21,152 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 1663 transitions. Word has length 236 [2020-12-23 04:19:21,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:19:21,153 INFO L481 AbstractCegarLoop]: Abstraction has 1428 states and 1663 transitions. [2020-12-23 04:19:21,153 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 04:19:21,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1663 transitions. [2020-12-23 04:19:21,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2020-12-23 04:19:21,158 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:19:21,158 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 04:19:21,371 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 04:19:21,372 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:19:21,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:19:21,374 INFO L82 PathProgramCache]: Analyzing trace with hash 98095693, now seen corresponding path program 1 times [2020-12-23 04:19:21,374 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:19:21,375 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929460878] [2020-12-23 04:19:21,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:19:21,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:19:21,713 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 159 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 04:19:21,713 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929460878] [2020-12-23 04:19:21,714 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942529494] [2020-12-23 04:19:21,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 04:19:21,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:19:21,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-23 04:19:21,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 04:19:22,102 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2020-12-23 04:19:22,102 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 04:19:22,103 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2020-12-23 04:19:22,103 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785101613] [2020-12-23 04:19:22,104 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 04:19:22,104 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:19:22,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 04:19:22,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-23 04:19:22,105 INFO L87 Difference]: Start difference. First operand 1428 states and 1663 transitions. Second operand 3 states. [2020-12-23 04:19:22,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:19:22,839 INFO L93 Difference]: Finished difference Result 1786 states and 2093 transitions. [2020-12-23 04:19:22,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 04:19:22,840 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 258 [2020-12-23 04:19:22,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:19:22,850 INFO L225 Difference]: With dead ends: 1786 [2020-12-23 04:19:22,850 INFO L226 Difference]: Without dead ends: 1784 [2020-12-23 04:19:22,851 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-23 04:19:22,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1784 states. [2020-12-23 04:19:22,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1784 to 1072. [2020-12-23 04:19:22,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1072 states. [2020-12-23 04:19:22,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1228 transitions. [2020-12-23 04:19:22,883 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1228 transitions. Word has length 258 [2020-12-23 04:19:22,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:19:22,884 INFO L481 AbstractCegarLoop]: Abstraction has 1072 states and 1228 transitions. [2020-12-23 04:19:22,885 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 04:19:22,885 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1228 transitions. [2020-12-23 04:19:22,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2020-12-23 04:19:22,892 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:19:22,892 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 04:19:23,105 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 04:19:23,106 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:19:23,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:19:23,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1856202521, now seen corresponding path program 1 times [2020-12-23 04:19:23,108 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:19:23,108 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132623143] [2020-12-23 04:19:23,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:19:23,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:19:23,486 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 362 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2020-12-23 04:19:23,486 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132623143] [2020-12-23 04:19:23,487 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 04:19:23,487 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 04:19:23,488 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330522383] [2020-12-23 04:19:23,490 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 04:19:23,494 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:19:23,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 04:19:23,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 04:19:23,495 INFO L87 Difference]: Start difference. First operand 1072 states and 1228 transitions. Second operand 3 states. [2020-12-23 04:19:24,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:19:24,336 INFO L93 Difference]: Finished difference Result 2676 states and 3103 transitions. [2020-12-23 04:19:24,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 04:19:24,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 345 [2020-12-23 04:19:24,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:19:24,346 INFO L225 Difference]: With dead ends: 2676 [2020-12-23 04:19:24,346 INFO L226 Difference]: Without dead ends: 1606 [2020-12-23 04:19:24,349 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 04:19:24,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2020-12-23 04:19:24,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1606. [2020-12-23 04:19:24,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1606 states. [2020-12-23 04:19:24,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 1801 transitions. [2020-12-23 04:19:24,396 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 1801 transitions. Word has length 345 [2020-12-23 04:19:24,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:19:24,397 INFO L481 AbstractCegarLoop]: Abstraction has 1606 states and 1801 transitions. [2020-12-23 04:19:24,397 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 04:19:24,397 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 1801 transitions. [2020-12-23 04:19:24,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2020-12-23 04:19:24,412 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:19:24,412 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 04:19:24,412 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 04:19:24,413 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:19:24,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:19:24,413 INFO L82 PathProgramCache]: Analyzing trace with hash -536437144, now seen corresponding path program 1 times [2020-12-23 04:19:24,414 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:19:24,414 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876130074] [2020-12-23 04:19:24,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:19:24,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:19:24,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1131 backedges. 736 proven. 0 refuted. 0 times theorem prover too weak. 395 trivial. 0 not checked. [2020-12-23 04:19:24,942 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876130074] [2020-12-23 04:19:24,942 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 04:19:24,942 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 04:19:24,942 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534062130] [2020-12-23 04:19:24,943 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 04:19:24,943 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:19:24,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 04:19:24,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 04:19:24,944 INFO L87 Difference]: Start difference. First operand 1606 states and 1801 transitions. Second operand 4 states. [2020-12-23 04:19:25,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:19:25,896 INFO L93 Difference]: Finished difference Result 3061 states and 3453 transitions. [2020-12-23 04:19:25,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 04:19:25,897 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 531 [2020-12-23 04:19:25,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:19:25,908 INFO L225 Difference]: With dead ends: 3061 [2020-12-23 04:19:25,908 INFO L226 Difference]: Without dead ends: 1784 [2020-12-23 04:19:25,911 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 04:19:25,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1784 states. [2020-12-23 04:19:25,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1784 to 1606. [2020-12-23 04:19:25,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1606 states. [2020-12-23 04:19:25,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 1740 transitions. [2020-12-23 04:19:25,953 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 1740 transitions. Word has length 531 [2020-12-23 04:19:25,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:19:25,954 INFO L481 AbstractCegarLoop]: Abstraction has 1606 states and 1740 transitions. [2020-12-23 04:19:25,954 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 04:19:25,954 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 1740 transitions. [2020-12-23 04:19:25,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 558 [2020-12-23 04:19:25,966 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:19:25,967 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 04:19:25,967 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 04:19:25,967 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:19:25,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:19:25,968 INFO L82 PathProgramCache]: Analyzing trace with hash 949883015, now seen corresponding path program 1 times [2020-12-23 04:19:25,968 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:19:25,968 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407098999] [2020-12-23 04:19:25,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:19:26,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:19:26,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1208 backedges. 823 proven. 11 refuted. 0 times theorem prover too weak. 374 trivial. 0 not checked. [2020-12-23 04:19:26,943 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407098999] [2020-12-23 04:19:26,943 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109202101] [2020-12-23 04:19:26,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 04:19:27,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:19:27,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 734 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 04:19:27,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 04:19:28,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1208 backedges. 518 proven. 0 refuted. 0 times theorem prover too weak. 690 trivial. 0 not checked. [2020-12-23 04:19:28,404 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 04:19:28,404 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2020-12-23 04:19:28,405 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786354896] [2020-12-23 04:19:28,405 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 04:19:28,405 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:19:28,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 04:19:28,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-23 04:19:28,407 INFO L87 Difference]: Start difference. First operand 1606 states and 1740 transitions. Second operand 3 states. [2020-12-23 04:19:29,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:19:29,131 INFO L93 Difference]: Finished difference Result 3032 states and 3302 transitions. [2020-12-23 04:19:29,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 04:19:29,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 557 [2020-12-23 04:19:29,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:19:29,140 INFO L225 Difference]: With dead ends: 3032 [2020-12-23 04:19:29,140 INFO L226 Difference]: Without dead ends: 1606 [2020-12-23 04:19:29,143 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 560 GetRequests, 556 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-23 04:19:29,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2020-12-23 04:19:29,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1606. [2020-12-23 04:19:29,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1606 states. [2020-12-23 04:19:29,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 1700 transitions. [2020-12-23 04:19:29,177 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 1700 transitions. Word has length 557 [2020-12-23 04:19:29,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:19:29,178 INFO L481 AbstractCegarLoop]: Abstraction has 1606 states and 1700 transitions. [2020-12-23 04:19:29,178 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 04:19:29,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 1700 transitions. [2020-12-23 04:19:29,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 625 [2020-12-23 04:19:29,184 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:19:29,184 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:19:29,398 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 04:19:29,399 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:19:29,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:19:29,400 INFO L82 PathProgramCache]: Analyzing trace with hash -588441920, now seen corresponding path program 1 times [2020-12-23 04:19:29,400 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:19:29,400 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70616740] [2020-12-23 04:19:29,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:19:29,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:19:29,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1208 backedges. 834 proven. 0 refuted. 0 times theorem prover too weak. 374 trivial. 0 not checked. [2020-12-23 04:19:29,912 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70616740] [2020-12-23 04:19:29,912 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 04:19:29,912 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 04:19:29,912 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649842363] [2020-12-23 04:19:29,913 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 04:19:29,913 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:19:29,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 04:19:29,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 04:19:29,914 INFO L87 Difference]: Start difference. First operand 1606 states and 1700 transitions. Second operand 3 states. [2020-12-23 04:19:30,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:19:30,682 INFO L93 Difference]: Finished difference Result 3210 states and 3448 transitions. [2020-12-23 04:19:30,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 04:19:30,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 624 [2020-12-23 04:19:30,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:19:30,691 INFO L225 Difference]: With dead ends: 3210 [2020-12-23 04:19:30,691 INFO L226 Difference]: Without dead ends: 1962 [2020-12-23 04:19:30,693 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 04:19:30,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2020-12-23 04:19:30,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1784. [2020-12-23 04:19:30,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1784 states. [2020-12-23 04:19:30,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 1888 transitions. [2020-12-23 04:19:30,735 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 1888 transitions. Word has length 624 [2020-12-23 04:19:30,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:19:30,736 INFO L481 AbstractCegarLoop]: Abstraction has 1784 states and 1888 transitions. [2020-12-23 04:19:30,736 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 04:19:30,736 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 1888 transitions. [2020-12-23 04:19:30,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 632 [2020-12-23 04:19:30,744 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:19:30,745 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:19:30,745 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 04:19:30,745 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:19:30,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:19:30,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1085598779, now seen corresponding path program 1 times [2020-12-23 04:19:30,746 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:19:30,747 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34330254] [2020-12-23 04:19:30,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:19:30,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:19:31,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1215 backedges. 841 proven. 0 refuted. 0 times theorem prover too weak. 374 trivial. 0 not checked. [2020-12-23 04:19:31,337 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34330254] [2020-12-23 04:19:31,337 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 04:19:31,337 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 04:19:31,338 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30956206] [2020-12-23 04:19:31,338 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 04:19:31,338 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:19:31,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 04:19:31,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 04:19:31,339 INFO L87 Difference]: Start difference. First operand 1784 states and 1888 transitions. Second operand 3 states. [2020-12-23 04:19:32,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:19:32,092 INFO L93 Difference]: Finished difference Result 3744 states and 4006 transitions. [2020-12-23 04:19:32,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 04:19:32,093 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 631 [2020-12-23 04:19:32,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:19:32,104 INFO L225 Difference]: With dead ends: 3744 [2020-12-23 04:19:32,104 INFO L226 Difference]: Without dead ends: 2318 [2020-12-23 04:19:32,107 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 04:19:32,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2318 states. [2020-12-23 04:19:32,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2318 to 2318. [2020-12-23 04:19:32,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2318 states. [2020-12-23 04:19:32,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 2450 transitions. [2020-12-23 04:19:32,153 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 2450 transitions. Word has length 631 [2020-12-23 04:19:32,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:19:32,154 INFO L481 AbstractCegarLoop]: Abstraction has 2318 states and 2450 transitions. [2020-12-23 04:19:32,154 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 04:19:32,154 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 2450 transitions. [2020-12-23 04:19:32,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 754 [2020-12-23 04:19:32,162 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:19:32,163 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 04:19:32,163 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 04:19:32,164 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:19:32,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:19:32,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1508589294, now seen corresponding path program 1 times [2020-12-23 04:19:32,165 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:19:32,165 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217879902] [2020-12-23 04:19:32,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:19:32,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:19:33,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1783 backedges. 1211 proven. 68 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2020-12-23 04:19:33,469 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217879902] [2020-12-23 04:19:33,470 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121659832] [2020-12-23 04:19:33,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 04:19:33,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:19:33,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 955 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 04:19:33,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 04:19:34,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1783 backedges. 1279 proven. 0 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2020-12-23 04:19:34,942 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 04:19:34,942 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2020-12-23 04:19:34,942 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265246691] [2020-12-23 04:19:34,943 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 04:19:34,943 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:19:34,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 04:19:34,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-12-23 04:19:34,944 INFO L87 Difference]: Start difference. First operand 2318 states and 2450 transitions. Second operand 4 states. [2020-12-23 04:19:35,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:19:35,994 INFO L93 Difference]: Finished difference Result 4278 states and 4539 transitions. [2020-12-23 04:19:35,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 04:19:35,995 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 753 [2020-12-23 04:19:35,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:19:36,005 INFO L225 Difference]: With dead ends: 4278 [2020-12-23 04:19:36,005 INFO L226 Difference]: Without dead ends: 2318 [2020-12-23 04:19:36,008 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 756 GetRequests, 751 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-12-23 04:19:36,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2318 states. [2020-12-23 04:19:36,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2318 to 2140. [2020-12-23 04:19:36,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2140 states. [2020-12-23 04:19:36,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 2140 states and 2269 transitions. [2020-12-23 04:19:36,044 INFO L78 Accepts]: Start accepts. Automaton has 2140 states and 2269 transitions. Word has length 753 [2020-12-23 04:19:36,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:19:36,045 INFO L481 AbstractCegarLoop]: Abstraction has 2140 states and 2269 transitions. [2020-12-23 04:19:36,045 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 04:19:36,046 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 2269 transitions. [2020-12-23 04:19:36,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 761 [2020-12-23 04:19:36,053 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:19:36,053 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 04:19:36,266 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2020-12-23 04:19:36,267 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:19:36,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:19:36,268 INFO L82 PathProgramCache]: Analyzing trace with hash -497366829, now seen corresponding path program 1 times [2020-12-23 04:19:36,269 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:19:36,269 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884582123] [2020-12-23 04:19:36,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:19:36,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:19:37,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1797 backedges. 1200 proven. 93 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2020-12-23 04:19:37,560 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884582123] [2020-12-23 04:19:37,561 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218909986] [2020-12-23 04:19:37,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 04:19:37,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:19:37,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 962 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 04:19:37,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 04:19:38,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1797 backedges. 1293 proven. 0 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2020-12-23 04:19:38,784 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 04:19:38,785 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2020-12-23 04:19:38,785 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407493671] [2020-12-23 04:19:38,786 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 04:19:38,786 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:19:38,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 04:19:38,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-23 04:19:38,787 INFO L87 Difference]: Start difference. First operand 2140 states and 2269 transitions. Second operand 3 states. [2020-12-23 04:19:39,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:19:39,472 INFO L93 Difference]: Finished difference Result 4100 states and 4357 transitions. [2020-12-23 04:19:39,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 04:19:39,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 760 [2020-12-23 04:19:39,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:19:39,483 INFO L225 Difference]: With dead ends: 4100 [2020-12-23 04:19:39,483 INFO L226 Difference]: Without dead ends: 2140 [2020-12-23 04:19:39,486 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 763 GetRequests, 759 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-23 04:19:39,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2020-12-23 04:19:39,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 2140. [2020-12-23 04:19:39,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2140 states. [2020-12-23 04:19:39,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 2140 states and 2256 transitions. [2020-12-23 04:19:39,522 INFO L78 Accepts]: Start accepts. Automaton has 2140 states and 2256 transitions. Word has length 760 [2020-12-23 04:19:39,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:19:39,523 INFO L481 AbstractCegarLoop]: Abstraction has 2140 states and 2256 transitions. [2020-12-23 04:19:39,523 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 04:19:39,523 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 2256 transitions. [2020-12-23 04:19:39,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 787 [2020-12-23 04:19:39,531 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:19:39,532 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 04:19:39,745 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 04:19:39,746 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:19:39,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:19:39,747 INFO L82 PathProgramCache]: Analyzing trace with hash 214444916, now seen corresponding path program 1 times [2020-12-23 04:19:39,748 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:19:39,748 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014748514] [2020-12-23 04:19:39,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:19:39,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:19:40,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1823 backedges. 1294 proven. 155 refuted. 0 times theorem prover too weak. 374 trivial. 0 not checked. [2020-12-23 04:19:40,565 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014748514] [2020-12-23 04:19:40,565 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445846726] [2020-12-23 04:19:40,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 04:19:40,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:19:40,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 991 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 04:19:40,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 04:19:41,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1823 backedges. 1294 proven. 155 refuted. 0 times theorem prover too weak. 374 trivial. 0 not checked. [2020-12-23 04:19:41,952 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 04:19:41,952 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2020-12-23 04:19:41,952 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298321205] [2020-12-23 04:19:41,954 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 04:19:41,954 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:19:41,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 04:19:41,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 04:19:41,956 INFO L87 Difference]: Start difference. First operand 2140 states and 2256 transitions. Second operand 4 states. [2020-12-23 04:19:43,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:19:43,035 INFO L93 Difference]: Finished difference Result 4812 states and 5112 transitions. [2020-12-23 04:19:43,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 04:19:43,036 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 786 [2020-12-23 04:19:43,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:19:43,049 INFO L225 Difference]: With dead ends: 4812 [2020-12-23 04:19:43,049 INFO L226 Difference]: Without dead ends: 2852 [2020-12-23 04:19:43,052 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 789 GetRequests, 787 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 04:19:43,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2020-12-23 04:19:43,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 2852. [2020-12-23 04:19:43,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2852 states. [2020-12-23 04:19:43,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 3022 transitions. [2020-12-23 04:19:43,122 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 3022 transitions. Word has length 786 [2020-12-23 04:19:43,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:19:43,123 INFO L481 AbstractCegarLoop]: Abstraction has 2852 states and 3022 transitions. [2020-12-23 04:19:43,123 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 04:19:43,123 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 3022 transitions. [2020-12-23 04:19:43,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 859 [2020-12-23 04:19:43,133 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:19:43,134 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 04:19:43,349 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 04:19:43,349 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:19:43,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:19:43,350 INFO L82 PathProgramCache]: Analyzing trace with hash 872479476, now seen corresponding path program 1 times [2020-12-23 04:19:43,351 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:19:43,351 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550384331] [2020-12-23 04:19:43,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:19:43,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:19:44,081 INFO L134 CoverageAnalysis]: Checked inductivity of 2312 backedges. 1485 proven. 0 refuted. 0 times theorem prover too weak. 827 trivial. 0 not checked. [2020-12-23 04:19:44,081 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550384331] [2020-12-23 04:19:44,082 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 04:19:44,082 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 04:19:44,082 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460419710] [2020-12-23 04:19:44,083 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 04:19:44,083 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:19:44,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 04:19:44,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 04:19:44,084 INFO L87 Difference]: Start difference. First operand 2852 states and 3022 transitions. Second operand 3 states. [2020-12-23 04:19:44,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:19:44,821 INFO L93 Difference]: Finished difference Result 6592 states and 7010 transitions. [2020-12-23 04:19:44,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 04:19:44,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 858 [2020-12-23 04:19:44,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:19:44,833 INFO L225 Difference]: With dead ends: 6592 [2020-12-23 04:19:44,834 INFO L226 Difference]: Without dead ends: 3920 [2020-12-23 04:19:44,836 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 04:19:44,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3920 states. [2020-12-23 04:19:44,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3920 to 3742. [2020-12-23 04:19:44,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3742 states. [2020-12-23 04:19:44,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3742 states to 3742 states and 3950 transitions. [2020-12-23 04:19:44,913 INFO L78 Accepts]: Start accepts. Automaton has 3742 states and 3950 transitions. Word has length 858 [2020-12-23 04:19:44,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:19:44,913 INFO L481 AbstractCegarLoop]: Abstraction has 3742 states and 3950 transitions. [2020-12-23 04:19:44,914 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 04:19:44,914 INFO L276 IsEmpty]: Start isEmpty. Operand 3742 states and 3950 transitions. [2020-12-23 04:19:44,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 877 [2020-12-23 04:19:44,924 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:19:44,925 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 04:19:44,925 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 04:19:44,925 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:19:44,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:19:44,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1606692097, now seen corresponding path program 1 times [2020-12-23 04:19:44,926 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:19:44,926 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871988530] [2020-12-23 04:19:44,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:19:44,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:19:46,299 INFO L134 CoverageAnalysis]: Checked inductivity of 2330 backedges. 1531 proven. 93 refuted. 0 times theorem prover too weak. 706 trivial. 0 not checked. [2020-12-23 04:19:46,299 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871988530] [2020-12-23 04:19:46,299 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626403273] [2020-12-23 04:19:46,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 04:19:46,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:19:46,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 1103 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 04:19:46,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 04:19:47,753 INFO L134 CoverageAnalysis]: Checked inductivity of 2330 backedges. 1624 proven. 0 refuted. 0 times theorem prover too weak. 706 trivial. 0 not checked. [2020-12-23 04:19:47,754 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 04:19:47,754 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2020-12-23 04:19:47,754 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128922137] [2020-12-23 04:19:47,755 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 04:19:47,755 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:19:47,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 04:19:47,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-23 04:19:47,756 INFO L87 Difference]: Start difference. First operand 3742 states and 3950 transitions. Second operand 3 states. [2020-12-23 04:19:48,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:19:48,472 INFO L93 Difference]: Finished difference Result 7660 states and 8081 transitions. [2020-12-23 04:19:48,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 04:19:48,473 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 876 [2020-12-23 04:19:48,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:19:48,490 INFO L225 Difference]: With dead ends: 7660 [2020-12-23 04:19:48,490 INFO L226 Difference]: Without dead ends: 4098 [2020-12-23 04:19:48,494 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 879 GetRequests, 875 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-23 04:19:48,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4098 states. [2020-12-23 04:19:48,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4098 to 3742. [2020-12-23 04:19:48,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3742 states. [2020-12-23 04:19:48,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3742 states to 3742 states and 3950 transitions. [2020-12-23 04:19:48,554 INFO L78 Accepts]: Start accepts. Automaton has 3742 states and 3950 transitions. Word has length 876 [2020-12-23 04:19:48,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:19:48,555 INFO L481 AbstractCegarLoop]: Abstraction has 3742 states and 3950 transitions. [2020-12-23 04:19:48,555 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 04:19:48,555 INFO L276 IsEmpty]: Start isEmpty. Operand 3742 states and 3950 transitions. [2020-12-23 04:19:48,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 916 [2020-12-23 04:19:48,568 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:19:48,569 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 04:19:48,782 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2020-12-23 04:19:48,783 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:19:48,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:19:48,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1753874618, now seen corresponding path program 1 times [2020-12-23 04:19:48,784 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:19:48,785 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895030677] [2020-12-23 04:19:48,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:19:48,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:19:50,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2534 backedges. 1761 proven. 260 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2020-12-23 04:19:50,210 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895030677] [2020-12-23 04:19:50,210 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1950317265] [2020-12-23 04:19:50,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 04:19:50,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:19:50,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 1142 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 04:19:50,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 04:19:51,866 INFO L134 CoverageAnalysis]: Checked inductivity of 2534 backedges. 1707 proven. 0 refuted. 0 times theorem prover too weak. 827 trivial. 0 not checked. [2020-12-23 04:19:51,866 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 04:19:51,866 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2020-12-23 04:19:51,867 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90708918] [2020-12-23 04:19:51,867 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 04:19:51,867 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:19:51,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 04:19:51,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-23 04:19:51,868 INFO L87 Difference]: Start difference. First operand 3742 states and 3950 transitions. Second operand 4 states. [2020-12-23 04:19:52,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:19:52,866 INFO L93 Difference]: Finished difference Result 7482 states and 7899 transitions. [2020-12-23 04:19:52,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 04:19:52,867 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 915 [2020-12-23 04:19:52,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:19:52,899 INFO L225 Difference]: With dead ends: 7482 [2020-12-23 04:19:52,899 INFO L226 Difference]: Without dead ends: 3920 [2020-12-23 04:19:52,904 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 919 GetRequests, 913 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-23 04:19:52,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3920 states. [2020-12-23 04:19:52,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3920 to 3742. [2020-12-23 04:19:52,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3742 states. [2020-12-23 04:19:52,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3742 states to 3742 states and 3946 transitions. [2020-12-23 04:19:52,960 INFO L78 Accepts]: Start accepts. Automaton has 3742 states and 3946 transitions. Word has length 915 [2020-12-23 04:19:52,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:19:52,961 INFO L481 AbstractCegarLoop]: Abstraction has 3742 states and 3946 transitions. [2020-12-23 04:19:52,961 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 04:19:52,961 INFO L276 IsEmpty]: Start isEmpty. Operand 3742 states and 3946 transitions. [2020-12-23 04:19:52,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 945 [2020-12-23 04:19:52,973 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:19:52,975 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 04:19:53,187 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2020-12-23 04:19:53,188 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:19:53,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:19:53,189 INFO L82 PathProgramCache]: Analyzing trace with hash 225721291, now seen corresponding path program 1 times [2020-12-23 04:19:53,189 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:19:53,190 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217104238] [2020-12-23 04:19:53,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:19:53,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:19:54,057 INFO L134 CoverageAnalysis]: Checked inductivity of 2589 backedges. 1762 proven. 0 refuted. 0 times theorem prover too weak. 827 trivial. 0 not checked. [2020-12-23 04:19:54,057 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217104238] [2020-12-23 04:19:54,058 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 04:19:54,058 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 04:19:54,058 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909866074] [2020-12-23 04:19:54,059 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 04:19:54,059 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:19:54,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 04:19:54,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 04:19:54,060 INFO L87 Difference]: Start difference. First operand 3742 states and 3946 transitions. Second operand 3 states. [2020-12-23 04:19:54,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:19:54,820 INFO L93 Difference]: Finished difference Result 7482 states and 7924 transitions. [2020-12-23 04:19:54,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 04:19:54,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 944 [2020-12-23 04:19:54,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:19:54,830 INFO L225 Difference]: With dead ends: 7482 [2020-12-23 04:19:54,830 INFO L226 Difference]: Without dead ends: 3920 [2020-12-23 04:19:54,834 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 04:19:54,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3920 states. [2020-12-23 04:19:54,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3920 to 3920. [2020-12-23 04:19:54,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3920 states. [2020-12-23 04:19:54,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3920 states to 3920 states and 4122 transitions. [2020-12-23 04:19:54,894 INFO L78 Accepts]: Start accepts. Automaton has 3920 states and 4122 transitions. Word has length 944 [2020-12-23 04:19:54,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:19:54,895 INFO L481 AbstractCegarLoop]: Abstraction has 3920 states and 4122 transitions. [2020-12-23 04:19:54,895 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 04:19:54,895 INFO L276 IsEmpty]: Start isEmpty. Operand 3920 states and 4122 transitions. [2020-12-23 04:19:54,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1029 [2020-12-23 04:19:54,912 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:19:54,913 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 04:19:54,913 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-23 04:19:54,913 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:19:54,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:19:54,914 INFO L82 PathProgramCache]: Analyzing trace with hash -812562896, now seen corresponding path program 1 times [2020-12-23 04:19:54,914 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:19:54,914 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081069757] [2020-12-23 04:19:54,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:19:55,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:19:55,838 INFO L134 CoverageAnalysis]: Checked inductivity of 3567 backedges. 1098 proven. 0 refuted. 0 times theorem prover too weak. 2469 trivial. 0 not checked. [2020-12-23 04:19:55,839 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081069757] [2020-12-23 04:19:55,839 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 04:19:55,839 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 04:19:55,839 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047369147] [2020-12-23 04:19:55,840 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 04:19:55,840 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:19:55,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 04:19:55,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 04:19:55,841 INFO L87 Difference]: Start difference. First operand 3920 states and 4122 transitions. Second operand 3 states. [2020-12-23 04:19:56,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:19:56,614 INFO L93 Difference]: Finished difference Result 8016 states and 8472 transitions. [2020-12-23 04:19:56,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 04:19:56,615 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1028 [2020-12-23 04:19:56,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:19:56,624 INFO L225 Difference]: With dead ends: 8016 [2020-12-23 04:19:56,624 INFO L226 Difference]: Without dead ends: 4276 [2020-12-23 04:19:56,628 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 04:19:56,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4276 states. [2020-12-23 04:19:56,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4276 to 4276. [2020-12-23 04:19:56,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4276 states. [2020-12-23 04:19:56,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4276 states to 4276 states and 4485 transitions. [2020-12-23 04:19:56,687 INFO L78 Accepts]: Start accepts. Automaton has 4276 states and 4485 transitions. Word has length 1028 [2020-12-23 04:19:56,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:19:56,688 INFO L481 AbstractCegarLoop]: Abstraction has 4276 states and 4485 transitions. [2020-12-23 04:19:56,688 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 04:19:56,688 INFO L276 IsEmpty]: Start isEmpty. Operand 4276 states and 4485 transitions. [2020-12-23 04:19:56,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1077 [2020-12-23 04:19:56,729 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:19:56,730 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 04:19:56,730 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-23 04:19:56,730 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:19:56,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:19:56,731 INFO L82 PathProgramCache]: Analyzing trace with hash -762251848, now seen corresponding path program 1 times [2020-12-23 04:19:56,731 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:19:56,731 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254164916] [2020-12-23 04:19:56,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:19:56,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:19:57,843 INFO L134 CoverageAnalysis]: Checked inductivity of 3764 backedges. 2688 proven. 72 refuted. 0 times theorem prover too weak. 1004 trivial. 0 not checked. [2020-12-23 04:19:57,843 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254164916] [2020-12-23 04:19:57,843 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1674998027] [2020-12-23 04:19:57,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 04:19:58,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:19:58,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 1350 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-23 04:19:58,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 04:19:59,726 INFO L134 CoverageAnalysis]: Checked inductivity of 3764 backedges. 2401 proven. 0 refuted. 0 times theorem prover too weak. 1363 trivial. 0 not checked. [2020-12-23 04:19:59,727 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 04:19:59,727 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2020-12-23 04:19:59,727 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519159264] [2020-12-23 04:19:59,728 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 04:19:59,728 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:19:59,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 04:19:59,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-12-23 04:19:59,729 INFO L87 Difference]: Start difference. First operand 4276 states and 4485 transitions. Second operand 4 states. [2020-12-23 04:20:00,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:20:00,901 INFO L93 Difference]: Finished difference Result 9262 states and 9721 transitions. [2020-12-23 04:20:00,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 04:20:00,901 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1076 [2020-12-23 04:20:00,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:20:00,911 INFO L225 Difference]: With dead ends: 9262 [2020-12-23 04:20:00,911 INFO L226 Difference]: Without dead ends: 5166 [2020-12-23 04:20:00,916 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1080 GetRequests, 1075 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-12-23 04:20:00,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5166 states. [2020-12-23 04:20:00,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5166 to 4810. [2020-12-23 04:20:00,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4810 states. [2020-12-23 04:20:00,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4810 states to 4810 states and 5036 transitions. [2020-12-23 04:20:00,976 INFO L78 Accepts]: Start accepts. Automaton has 4810 states and 5036 transitions. Word has length 1076 [2020-12-23 04:20:00,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:20:00,977 INFO L481 AbstractCegarLoop]: Abstraction has 4810 states and 5036 transitions. [2020-12-23 04:20:00,977 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 04:20:00,977 INFO L276 IsEmpty]: Start isEmpty. Operand 4810 states and 5036 transitions. [2020-12-23 04:20:00,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1079 [2020-12-23 04:20:00,991 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:20:00,992 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 04:20:01,205 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 04:20:01,206 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:20:01,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:20:01,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1711834715, now seen corresponding path program 1 times [2020-12-23 04:20:01,207 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:20:01,208 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477476208] [2020-12-23 04:20:01,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:20:01,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:20:02,494 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 2117 proven. 0 refuted. 0 times theorem prover too weak. 1305 trivial. 0 not checked. [2020-12-23 04:20:02,494 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477476208] [2020-12-23 04:20:02,494 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 04:20:02,494 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 04:20:02,495 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704349779] [2020-12-23 04:20:02,495 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 04:20:02,496 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:20:02,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 04:20:02,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 04:20:02,499 INFO L87 Difference]: Start difference. First operand 4810 states and 5036 transitions. Second operand 3 states. [2020-12-23 04:20:03,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:20:03,243 INFO L93 Difference]: Finished difference Result 9796 states and 10250 transitions. [2020-12-23 04:20:03,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 04:20:03,244 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1078 [2020-12-23 04:20:03,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:20:03,253 INFO L225 Difference]: With dead ends: 9796 [2020-12-23 04:20:03,253 INFO L226 Difference]: Without dead ends: 4988 [2020-12-23 04:20:03,258 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 04:20:03,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4988 states. [2020-12-23 04:20:03,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4988 to 4632. [2020-12-23 04:20:03,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4632 states. [2020-12-23 04:20:03,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 4827 transitions. [2020-12-23 04:20:03,349 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 4827 transitions. Word has length 1078 [2020-12-23 04:20:03,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:20:03,350 INFO L481 AbstractCegarLoop]: Abstraction has 4632 states and 4827 transitions. [2020-12-23 04:20:03,350 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 04:20:03,350 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 4827 transitions. [2020-12-23 04:20:03,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1134 [2020-12-23 04:20:03,367 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:20:03,368 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 04:20:03,368 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-23 04:20:03,368 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:20:03,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:20:03,369 INFO L82 PathProgramCache]: Analyzing trace with hash 249347584, now seen corresponding path program 1 times [2020-12-23 04:20:03,369 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:20:03,369 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762373416] [2020-12-23 04:20:03,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:20:03,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:20:05,342 INFO L134 CoverageAnalysis]: Checked inductivity of 4042 backedges. 2720 proven. 325 refuted. 0 times theorem prover too weak. 997 trivial. 0 not checked. [2020-12-23 04:20:05,342 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762373416] [2020-12-23 04:20:05,342 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726430640] [2020-12-23 04:20:05,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 04:20:05,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:20:05,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 1404 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-23 04:20:05,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 04:20:07,723 INFO L134 CoverageAnalysis]: Checked inductivity of 4042 backedges. 2655 proven. 0 refuted. 0 times theorem prover too weak. 1387 trivial. 0 not checked. [2020-12-23 04:20:07,723 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 04:20:07,724 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2020-12-23 04:20:07,724 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742894771] [2020-12-23 04:20:07,724 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 04:20:07,725 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:20:07,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 04:20:07,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-23 04:20:07,725 INFO L87 Difference]: Start difference. First operand 4632 states and 4827 transitions. Second operand 4 states. [2020-12-23 04:20:08,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:20:08,801 INFO L93 Difference]: Finished difference Result 9262 states and 9653 transitions. [2020-12-23 04:20:08,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 04:20:08,801 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1133 [2020-12-23 04:20:08,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:20:08,811 INFO L225 Difference]: With dead ends: 9262 [2020-12-23 04:20:08,811 INFO L226 Difference]: Without dead ends: 4810 [2020-12-23 04:20:08,816 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1137 GetRequests, 1131 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-23 04:20:08,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4810 states. [2020-12-23 04:20:08,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4810 to 4632. [2020-12-23 04:20:08,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4632 states. [2020-12-23 04:20:08,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 4825 transitions. [2020-12-23 04:20:08,926 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 4825 transitions. Word has length 1133 [2020-12-23 04:20:08,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:20:08,927 INFO L481 AbstractCegarLoop]: Abstraction has 4632 states and 4825 transitions. [2020-12-23 04:20:08,927 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 04:20:08,927 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 4825 transitions. [2020-12-23 04:20:08,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1163 [2020-12-23 04:20:08,944 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:20:08,944 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 04:20:09,157 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2020-12-23 04:20:09,158 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:20:09,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:20:09,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1523991103, now seen corresponding path program 1 times [2020-12-23 04:20:09,159 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:20:09,159 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067510680] [2020-12-23 04:20:09,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:20:09,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:20:10,738 INFO L134 CoverageAnalysis]: Checked inductivity of 4100 backedges. 2713 proven. 0 refuted. 0 times theorem prover too weak. 1387 trivial. 0 not checked. [2020-12-23 04:20:10,738 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067510680] [2020-12-23 04:20:10,738 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 04:20:10,738 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 04:20:10,738 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646135122] [2020-12-23 04:20:10,739 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 04:20:10,739 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:20:10,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 04:20:10,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 04:20:10,740 INFO L87 Difference]: Start difference. First operand 4632 states and 4825 transitions. Second operand 3 states. [2020-12-23 04:20:11,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:20:11,482 INFO L93 Difference]: Finished difference Result 9262 states and 9649 transitions. [2020-12-23 04:20:11,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 04:20:11,485 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1162 [2020-12-23 04:20:11,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:20:11,492 INFO L225 Difference]: With dead ends: 9262 [2020-12-23 04:20:11,492 INFO L226 Difference]: Without dead ends: 4810 [2020-12-23 04:20:11,497 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 04:20:11,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4810 states. [2020-12-23 04:20:11,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4810 to 4810. [2020-12-23 04:20:11,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4810 states. [2020-12-23 04:20:11,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4810 states to 4810 states and 4993 transitions. [2020-12-23 04:20:11,564 INFO L78 Accepts]: Start accepts. Automaton has 4810 states and 4993 transitions. Word has length 1162 [2020-12-23 04:20:11,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:20:11,565 INFO L481 AbstractCegarLoop]: Abstraction has 4810 states and 4993 transitions. [2020-12-23 04:20:11,565 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 04:20:11,565 INFO L276 IsEmpty]: Start isEmpty. Operand 4810 states and 4993 transitions. [2020-12-23 04:20:11,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1237 [2020-12-23 04:20:11,584 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:20:11,584 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 04:20:11,585 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-23 04:20:11,585 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:20:11,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:20:11,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1150284910, now seen corresponding path program 1 times [2020-12-23 04:20:11,586 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:20:11,586 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384122746] [2020-12-23 04:20:11,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:20:11,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:20:12,697 INFO L134 CoverageAnalysis]: Checked inductivity of 4469 backedges. 2528 proven. 0 refuted. 0 times theorem prover too weak. 1941 trivial. 0 not checked. [2020-12-23 04:20:12,697 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384122746] [2020-12-23 04:20:12,698 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 04:20:12,698 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 04:20:12,698 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605403246] [2020-12-23 04:20:12,699 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 04:20:12,699 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:20:12,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 04:20:12,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 04:20:12,699 INFO L87 Difference]: Start difference. First operand 4810 states and 4993 transitions. Second operand 3 states. [2020-12-23 04:20:13,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:20:13,463 INFO L93 Difference]: Finished difference Result 9440 states and 9805 transitions. [2020-12-23 04:20:13,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 04:20:13,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1236 [2020-12-23 04:20:13,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:20:13,471 INFO L225 Difference]: With dead ends: 9440 [2020-12-23 04:20:13,471 INFO L226 Difference]: Without dead ends: 4810 [2020-12-23 04:20:13,476 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 04:20:13,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4810 states. [2020-12-23 04:20:13,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4810 to 4632. [2020-12-23 04:20:13,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4632 states. [2020-12-23 04:20:13,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 4775 transitions. [2020-12-23 04:20:13,565 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 4775 transitions. Word has length 1236 [2020-12-23 04:20:13,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:20:13,566 INFO L481 AbstractCegarLoop]: Abstraction has 4632 states and 4775 transitions. [2020-12-23 04:20:13,566 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 04:20:13,566 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 4775 transitions. [2020-12-23 04:20:13,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1317 [2020-12-23 04:20:13,589 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:20:13,590 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 04:20:13,590 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-23 04:20:13,590 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:20:13,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:20:13,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1112642584, now seen corresponding path program 1 times [2020-12-23 04:20:13,591 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:20:13,592 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085990575] [2020-12-23 04:20:13,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:20:13,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:20:15,219 INFO L134 CoverageAnalysis]: Checked inductivity of 5799 backedges. 3661 proven. 0 refuted. 0 times theorem prover too weak. 2138 trivial. 0 not checked. [2020-12-23 04:20:15,220 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085990575] [2020-12-23 04:20:15,220 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 04:20:15,220 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 04:20:15,220 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039856733] [2020-12-23 04:20:15,221 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 04:20:15,221 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 04:20:15,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 04:20:15,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 04:20:15,221 INFO L87 Difference]: Start difference. First operand 4632 states and 4775 transitions. Second operand 4 states. [2020-12-23 04:20:16,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 04:20:16,560 INFO L93 Difference]: Finished difference Result 9084 states and 9369 transitions. [2020-12-23 04:20:16,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 04:20:16,560 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1316 [2020-12-23 04:20:16,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 04:20:16,568 INFO L225 Difference]: With dead ends: 9084 [2020-12-23 04:20:16,568 INFO L226 Difference]: Without dead ends: 4632 [2020-12-23 04:20:16,572 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 04:20:16,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4632 states. [2020-12-23 04:20:16,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4632 to 4632. [2020-12-23 04:20:16,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4632 states. [2020-12-23 04:20:16,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 4748 transitions. [2020-12-23 04:20:16,627 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 4748 transitions. Word has length 1316 [2020-12-23 04:20:16,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 04:20:16,628 INFO L481 AbstractCegarLoop]: Abstraction has 4632 states and 4748 transitions. [2020-12-23 04:20:16,628 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 04:20:16,628 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 4748 transitions. [2020-12-23 04:20:16,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1486 [2020-12-23 04:20:16,649 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 04:20:16,650 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 04:20:16,650 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-12-23 04:20:16,651 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 04:20:16,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 04:20:16,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1220920875, now seen corresponding path program 1 times [2020-12-23 04:20:16,652 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 04:20:16,652 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267980553] [2020-12-23 04:20:16,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 04:20:16,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:20:18,879 INFO L134 CoverageAnalysis]: Checked inductivity of 6478 backedges. 2852 proven. 120 refuted. 0 times theorem prover too weak. 3506 trivial. 0 not checked. [2020-12-23 04:20:18,880 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267980553] [2020-12-23 04:20:18,880 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882805444] [2020-12-23 04:20:18,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 04:20:19,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 04:20:19,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 1803 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-23 04:20:19,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 04:20:20,617 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 04:20:20,620 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 04:20:20,627 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 04:20:20,630 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 04:20:20,669 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 04:20:20,697 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 04:20:20,705 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 04:20:20,714 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-23 04:20:20,725 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-23 04:20:20,917 INFO L757 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:20:21,082 INFO L757 QuantifierPusher]: Run 20 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:20:21,288 INFO L757 QuantifierPusher]: Run 30 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:20:21,539 INFO L757 QuantifierPusher]: Run 40 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:20:21,841 INFO L757 QuantifierPusher]: Run 50 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:20:22,684 INFO L757 QuantifierPusher]: Run 60 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:20:23,910 INFO L757 QuantifierPusher]: Run 70 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:20:25,419 INFO L757 QuantifierPusher]: Run 80 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:20:27,067 INFO L757 QuantifierPusher]: Run 90 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:20:29,112 INFO L757 QuantifierPusher]: Run 100 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:20:31,617 INFO L757 QuantifierPusher]: Run 110 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:20:33,632 INFO L757 QuantifierPusher]: Run 120 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:20:34,866 INFO L757 QuantifierPusher]: Run 130 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:20:35,592 INFO L757 QuantifierPusher]: Run 140 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:20:36,416 INFO L757 QuantifierPusher]: Run 150 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:20:37,346 INFO L757 QuantifierPusher]: Run 160 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:20:38,651 INFO L757 QuantifierPusher]: Run 170 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:20:39,965 INFO L757 QuantifierPusher]: Run 180 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:20:41,406 INFO L757 QuantifierPusher]: Run 190 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:20:42,751 INFO L757 QuantifierPusher]: Run 200 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:20:44,159 INFO L757 QuantifierPusher]: Run 210 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:20:45,754 INFO L757 QuantifierPusher]: Run 220 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:20:47,453 INFO L757 QuantifierPusher]: Run 230 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:20:49,245 INFO L757 QuantifierPusher]: Run 240 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:20:51,280 INFO L757 QuantifierPusher]: Run 250 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:20:53,728 INFO L757 QuantifierPusher]: Run 260 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:20:56,189 INFO L757 QuantifierPusher]: Run 270 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:20:58,829 INFO L757 QuantifierPusher]: Run 280 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:21:01,600 INFO L757 QuantifierPusher]: Run 290 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:21:04,366 INFO L757 QuantifierPusher]: Run 300 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:21:07,405 INFO L757 QuantifierPusher]: Run 310 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:21:10,620 INFO L757 QuantifierPusher]: Run 320 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:21:14,059 INFO L757 QuantifierPusher]: Run 330 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:21:17,897 INFO L757 QuantifierPusher]: Run 340 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:21:22,039 INFO L757 QuantifierPusher]: Run 350 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:21:26,451 INFO L757 QuantifierPusher]: Run 360 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:21:31,142 INFO L757 QuantifierPusher]: Run 370 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:21:36,517 INFO L757 QuantifierPusher]: Run 380 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:21:41,631 INFO L757 QuantifierPusher]: Run 390 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:21:46,811 INFO L757 QuantifierPusher]: Run 400 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:21:52,043 INFO L757 QuantifierPusher]: Run 410 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:21:57,382 INFO L757 QuantifierPusher]: Run 420 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:22:03,310 INFO L757 QuantifierPusher]: Run 430 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:22:09,656 INFO L757 QuantifierPusher]: Run 440 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:22:15,934 INFO L757 QuantifierPusher]: Run 450 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:22:22,896 INFO L757 QuantifierPusher]: Run 460 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:22:31,579 INFO L757 QuantifierPusher]: Run 470 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:22:40,994 INFO L757 QuantifierPusher]: Run 480 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:22:50,993 INFO L757 QuantifierPusher]: Run 490 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:22:59,124 INFO L757 QuantifierPusher]: Run 500 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-12-23 04:23:07,005 INFO L757 QuantifierPusher]: Run 510 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug.