/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_label29.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 14:14:04,029 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 14:14:04,031 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 14:14:04,069 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 14:14:04,070 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 14:14:04,071 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 14:14:04,073 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 14:14:04,076 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 14:14:04,078 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 14:14:04,079 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 14:14:04,081 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 14:14:04,082 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 14:14:04,083 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 14:14:04,084 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 14:14:04,086 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 14:14:04,087 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 14:14:04,089 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 14:14:04,090 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 14:14:04,092 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 14:14:04,095 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 14:14:04,097 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 14:14:04,099 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 14:14:04,101 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 14:14:04,103 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 14:14:04,106 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 14:14:04,107 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 14:14:04,107 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 14:14:04,108 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 14:14:04,109 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 14:14:04,110 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 14:14:04,111 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 14:14:04,112 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 14:14:04,127 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 14:14:04,128 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 14:14:04,129 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 14:14:04,130 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 14:14:04,131 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 14:14:04,131 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 14:14:04,131 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 14:14:04,136 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 14:14:04,140 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 14:14:04,143 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 14:14:04,193 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 14:14:04,193 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 14:14:04,198 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 14:14:04,198 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 14:14:04,198 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 14:14:04,198 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 14:14:04,199 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 14:14:04,199 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 14:14:04,199 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 14:14:04,199 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 14:14:04,200 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 14:14:04,201 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 14:14:04,201 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 14:14:04,201 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 14:14:04,201 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 14:14:04,202 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 14:14:04,202 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 14:14:04,202 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 14:14:04,202 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 14:14:04,202 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 14:14:04,203 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 14:14:04,203 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 14:14:04,203 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 14:14:04,203 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 14:14:04,203 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 14:14:04,204 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 [2021-01-06 14:14:04,659 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 14:14:04,694 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 14:14:04,698 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 14:14:04,699 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 14:14:04,700 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 14:14:04,701 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem14_label29.c [2021-01-06 14:14:04,793 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/51e860db5/59e2b1b4e3724ec391dd2e60b67d5c73/FLAGcfe40875e [2021-01-06 14:14:05,715 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 14:14:05,715 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label29.c [2021-01-06 14:14:05,730 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/51e860db5/59e2b1b4e3724ec391dd2e60b67d5c73/FLAGcfe40875e [2021-01-06 14:14:05,873 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/51e860db5/59e2b1b4e3724ec391dd2e60b67d5c73 [2021-01-06 14:14:05,876 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 14:14:05,880 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 14:14:05,883 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 14:14:05,884 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 14:14:05,887 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 14:14:05,888 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 02:14:05" (1/1) ... [2021-01-06 14:14:05,890 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4afb2eef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 02:14:05, skipping insertion in model container [2021-01-06 14:14:05,891 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 02:14:05" (1/1) ... [2021-01-06 14:14:05,903 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 14:14:05,979 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-06 14:14:06,176 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_label29.c[1924,1937] 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,] [2021-01-06 14:14:06,576 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 14:14:06,585 INFO L203 MainTranslator]: Completed pre-run [2021-01-06 14:14:06,602 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_label29.c[1924,1937] 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,] [2021-01-06 14:14:06,715 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 14:14:06,732 INFO L208 MainTranslator]: Completed translation [2021-01-06 14:14:06,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 02:14:06 WrapperNode [2021-01-06 14:14:06,733 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 14:14:06,734 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 14:14:06,734 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 14:14:06,735 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 14:14:06,742 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 02:14:06" (1/1) ... [2021-01-06 14:14:06,768 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 02:14:06" (1/1) ... [2021-01-06 14:14:06,853 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 14:14:06,854 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 14:14:06,854 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 14:14:06,855 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 14:14:06,868 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 02:14:06" (1/1) ... [2021-01-06 14:14:06,869 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 02:14:06" (1/1) ... [2021-01-06 14:14:06,875 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 02:14:06" (1/1) ... [2021-01-06 14:14:06,876 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 02:14:06" (1/1) ... [2021-01-06 14:14:06,906 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 02:14:06" (1/1) ... [2021-01-06 14:14:06,919 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 02:14:06" (1/1) ... [2021-01-06 14:14:06,931 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 02:14:06" (1/1) ... [2021-01-06 14:14:06,959 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 14:14:06,963 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 14:14:06,963 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 14:14:06,963 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 14:14:06,966 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 02:14:06" (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 [2021-01-06 14:14:07,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 14:14:07,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 14:14:07,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 14:14:07,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 14:14:08,787 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 14:14:08,787 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-01-06 14:14:08,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 02:14:08 BoogieIcfgContainer [2021-01-06 14:14:08,790 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 14:14:08,792 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 14:14:08,792 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 14:14:08,796 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 14:14:08,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 02:14:05" (1/3) ... [2021-01-06 14:14:08,797 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e4b9b97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 02:14:08, skipping insertion in model container [2021-01-06 14:14:08,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 02:14:06" (2/3) ... [2021-01-06 14:14:08,798 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e4b9b97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 02:14:08, skipping insertion in model container [2021-01-06 14:14:08,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 02:14:08" (3/3) ... [2021-01-06 14:14:08,800 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem14_label29.c [2021-01-06 14:14:08,807 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 14:14:08,814 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 14:14:08,835 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 14:14:08,866 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 14:14:08,866 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 14:14:08,866 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 14:14:08,867 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 14:14:08,867 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 14:14:08,867 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 14:14:08,867 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 14:14:08,867 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 14:14:08,890 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states. [2021-01-06 14:14:08,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-01-06 14:14:08,897 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:14:08,898 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:14:08,899 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:14:08,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:14:08,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1657508526, now seen corresponding path program 1 times [2021-01-06 14:14:08,916 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:14:08,916 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969088177] [2021-01-06 14:14:08,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:14:09,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:14:09,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 14:14:09,211 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969088177] [2021-01-06 14:14:09,212 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:14:09,212 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 14:14:09,213 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364045927] [2021-01-06 14:14:09,218 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:14:09,218 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:14:09,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:14:09,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:14:09,237 INFO L87 Difference]: Start difference. First operand 245 states. Second operand 3 states. [2021-01-06 14:14:10,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:14:10,522 INFO L93 Difference]: Finished difference Result 685 states and 1216 transitions. [2021-01-06 14:14:10,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:14:10,524 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2021-01-06 14:14:10,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:14:10,542 INFO L225 Difference]: With dead ends: 685 [2021-01-06 14:14:10,542 INFO L226 Difference]: Without dead ends: 360 [2021-01-06 14:14:10,548 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:14:10,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2021-01-06 14:14:10,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2021-01-06 14:14:10,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2021-01-06 14:14:10,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 510 transitions. [2021-01-06 14:14:10,617 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 510 transitions. Word has length 16 [2021-01-06 14:14:10,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:14:10,617 INFO L481 AbstractCegarLoop]: Abstraction has 360 states and 510 transitions. [2021-01-06 14:14:10,617 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:14:10,617 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 510 transitions. [2021-01-06 14:14:10,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-01-06 14:14:10,621 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:14:10,622 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:14:10,622 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 14:14:10,622 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:14:10,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:14:10,623 INFO L82 PathProgramCache]: Analyzing trace with hash -2102583707, now seen corresponding path program 1 times [2021-01-06 14:14:10,623 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:14:10,624 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314415581] [2021-01-06 14:14:10,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:14:10,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:14:10,982 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 14:14:10,982 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314415581] [2021-01-06 14:14:10,982 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:14:10,983 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 14:14:10,983 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544943373] [2021-01-06 14:14:10,985 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 14:14:10,985 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:14:10,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 14:14:10,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 14:14:10,986 INFO L87 Difference]: Start difference. First operand 360 states and 510 transitions. Second operand 4 states. [2021-01-06 14:14:12,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:14:12,528 INFO L93 Difference]: Finished difference Result 1074 states and 1446 transitions. [2021-01-06 14:14:12,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 14:14:12,529 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2021-01-06 14:14:12,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:14:12,536 INFO L225 Difference]: With dead ends: 1074 [2021-01-06 14:14:12,537 INFO L226 Difference]: Without dead ends: 716 [2021-01-06 14:14:12,540 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 [2021-01-06 14:14:12,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2021-01-06 14:14:12,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 716. [2021-01-06 14:14:12,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 716 states. [2021-01-06 14:14:12,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 902 transitions. [2021-01-06 14:14:12,591 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 902 transitions. Word has length 95 [2021-01-06 14:14:12,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:14:12,592 INFO L481 AbstractCegarLoop]: Abstraction has 716 states and 902 transitions. [2021-01-06 14:14:12,592 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 14:14:12,592 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 902 transitions. [2021-01-06 14:14:12,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-01-06 14:14:12,597 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:14:12,597 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:14:12,598 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 14:14:12,598 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:14:12,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:14:12,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1932417188, now seen corresponding path program 1 times [2021-01-06 14:14:12,599 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:14:12,599 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640081298] [2021-01-06 14:14:12,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:14:12,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:14:12,841 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 14:14:12,842 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640081298] [2021-01-06 14:14:12,842 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945152424] [2021-01-06 14:14:12,843 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 [2021-01-06 14:14:12,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:14:12,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 14:14:12,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 14:14:13,142 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 14:14:13,143 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 14:14:13,144 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2021-01-06 14:14:13,144 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015092131] [2021-01-06 14:14:13,145 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:14:13,145 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:14:13,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:14:13,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 14:14:13,146 INFO L87 Difference]: Start difference. First operand 716 states and 902 transitions. Second operand 3 states. [2021-01-06 14:14:14,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:14:14,141 INFO L93 Difference]: Finished difference Result 1074 states and 1410 transitions. [2021-01-06 14:14:14,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:14:14,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2021-01-06 14:14:14,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:14:14,154 INFO L225 Difference]: With dead ends: 1074 [2021-01-06 14:14:14,154 INFO L226 Difference]: Without dead ends: 1072 [2021-01-06 14:14:14,155 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 14:14:14,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2021-01-06 14:14:14,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 894. [2021-01-06 14:14:14,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 894 states. [2021-01-06 14:14:14,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1194 transitions. [2021-01-06 14:14:14,229 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1194 transitions. Word has length 121 [2021-01-06 14:14:14,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:14:14,234 INFO L481 AbstractCegarLoop]: Abstraction has 894 states and 1194 transitions. [2021-01-06 14:14:14,234 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:14:14,234 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1194 transitions. [2021-01-06 14:14:14,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2021-01-06 14:14:14,247 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:14:14,248 INFO L422 BasicCegarLoop]: trace histogram [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, 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] [2021-01-06 14:14:14,449 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-01-06 14:14:14,450 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:14:14,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:14:14,451 INFO L82 PathProgramCache]: Analyzing trace with hash 769273339, now seen corresponding path program 1 times [2021-01-06 14:14:14,452 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:14:14,452 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548218821] [2021-01-06 14:14:14,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:14:14,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:14:14,782 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 14:14:14,783 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548218821] [2021-01-06 14:14:14,784 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:14:14,784 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 14:14:14,785 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936365086] [2021-01-06 14:14:14,787 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 14:14:14,788 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:14:14,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 14:14:14,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 14:14:14,790 INFO L87 Difference]: Start difference. First operand 894 states and 1194 transitions. Second operand 4 states. [2021-01-06 14:14:15,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:14:15,906 INFO L93 Difference]: Finished difference Result 1993 states and 2629 transitions. [2021-01-06 14:14:15,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 14:14:15,907 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 187 [2021-01-06 14:14:15,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:14:15,913 INFO L225 Difference]: With dead ends: 1993 [2021-01-06 14:14:15,913 INFO L226 Difference]: Without dead ends: 1072 [2021-01-06 14:14:15,916 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 [2021-01-06 14:14:15,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2021-01-06 14:14:15,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 1072. [2021-01-06 14:14:15,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1072 states. [2021-01-06 14:14:15,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1264 transitions. [2021-01-06 14:14:15,944 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1264 transitions. Word has length 187 [2021-01-06 14:14:15,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:14:15,944 INFO L481 AbstractCegarLoop]: Abstraction has 1072 states and 1264 transitions. [2021-01-06 14:14:15,944 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 14:14:15,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1264 transitions. [2021-01-06 14:14:15,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2021-01-06 14:14:15,946 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:14:15,947 INFO L422 BasicCegarLoop]: trace histogram [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, 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] [2021-01-06 14:14:15,947 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 14:14:15,947 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:14:15,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:14:15,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1054794931, now seen corresponding path program 1 times [2021-01-06 14:14:15,948 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:14:15,948 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845947844] [2021-01-06 14:14:15,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:14:15,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:14:16,206 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 27 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 14:14:16,206 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845947844] [2021-01-06 14:14:16,206 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342256407] [2021-01-06 14:14:16,207 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 [2021-01-06 14:14:16,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:14:16,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 14:14:16,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 14:14:16,629 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-01-06 14:14:16,630 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 14:14:16,630 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2021-01-06 14:14:16,630 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552325519] [2021-01-06 14:14:16,631 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:14:16,631 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:14:16,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:14:16,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-01-06 14:14:16,633 INFO L87 Difference]: Start difference. First operand 1072 states and 1264 transitions. Second operand 3 states. [2021-01-06 14:14:17,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:14:17,415 INFO L93 Difference]: Finished difference Result 2498 states and 3033 transitions. [2021-01-06 14:14:17,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:14:17,416 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2021-01-06 14:14:17,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:14:17,424 INFO L225 Difference]: With dead ends: 2498 [2021-01-06 14:14:17,424 INFO L226 Difference]: Without dead ends: 1428 [2021-01-06 14:14:17,426 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-01-06 14:14:17,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2021-01-06 14:14:17,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1250. [2021-01-06 14:14:17,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1250 states. [2021-01-06 14:14:17,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1504 transitions. [2021-01-06 14:14:17,456 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1504 transitions. Word has length 187 [2021-01-06 14:14:17,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:14:17,457 INFO L481 AbstractCegarLoop]: Abstraction has 1250 states and 1504 transitions. [2021-01-06 14:14:17,457 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:14:17,457 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1504 transitions. [2021-01-06 14:14:17,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2021-01-06 14:14:17,459 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:14:17,460 INFO L422 BasicCegarLoop]: trace histogram [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, 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] [2021-01-06 14:14:17,675 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:14:17,676 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:14:17,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:14:17,677 INFO L82 PathProgramCache]: Analyzing trace with hash -517258260, now seen corresponding path program 1 times [2021-01-06 14:14:17,678 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:14:17,679 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517761786] [2021-01-06 14:14:17,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:14:17,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:14:18,007 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 27 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 14:14:18,008 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517761786] [2021-01-06 14:14:18,008 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602486016] [2021-01-06 14:14:18,009 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 [2021-01-06 14:14:18,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:14:18,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 14:14:18,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 14:14:18,281 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2021-01-06 14:14:18,281 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 14:14:18,282 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2021-01-06 14:14:18,283 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084399083] [2021-01-06 14:14:18,285 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:14:18,290 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:14:18,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:14:18,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 14:14:18,291 INFO L87 Difference]: Start difference. First operand 1250 states and 1504 transitions. Second operand 3 states. [2021-01-06 14:14:19,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:14:19,008 INFO L93 Difference]: Finished difference Result 3032 states and 3617 transitions. [2021-01-06 14:14:19,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:14:19,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 190 [2021-01-06 14:14:19,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:14:19,017 INFO L225 Difference]: With dead ends: 3032 [2021-01-06 14:14:19,017 INFO L226 Difference]: Without dead ends: 1606 [2021-01-06 14:14:19,020 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 14:14:19,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2021-01-06 14:14:19,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1250. [2021-01-06 14:14:19,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1250 states. [2021-01-06 14:14:19,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1481 transitions. [2021-01-06 14:14:19,052 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1481 transitions. Word has length 190 [2021-01-06 14:14:19,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:14:19,053 INFO L481 AbstractCegarLoop]: Abstraction has 1250 states and 1481 transitions. [2021-01-06 14:14:19,053 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:14:19,053 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1481 transitions. [2021-01-06 14:14:19,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2021-01-06 14:14:19,056 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:14:19,056 INFO L422 BasicCegarLoop]: trace histogram [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, 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] [2021-01-06 14:14:19,269 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:14:19,270 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:14:19,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:14:19,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1331075403, now seen corresponding path program 1 times [2021-01-06 14:14:19,272 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:14:19,272 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981216389] [2021-01-06 14:14:19,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:14:19,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:14:19,527 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 67 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 14:14:19,528 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981216389] [2021-01-06 14:14:19,528 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1484983989] [2021-01-06 14:14:19,528 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 [2021-01-06 14:14:19,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:14:19,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 14:14:19,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 14:14:19,835 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2021-01-06 14:14:19,836 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 14:14:19,836 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2021-01-06 14:14:19,836 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400765322] [2021-01-06 14:14:19,837 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:14:19,838 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:14:19,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:14:19,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 14:14:19,839 INFO L87 Difference]: Start difference. First operand 1250 states and 1481 transitions. Second operand 3 states. [2021-01-06 14:14:20,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:14:20,629 INFO L93 Difference]: Finished difference Result 1608 states and 1911 transitions. [2021-01-06 14:14:20,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:14:20,630 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2021-01-06 14:14:20,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:14:20,639 INFO L225 Difference]: With dead ends: 1608 [2021-01-06 14:14:20,639 INFO L226 Difference]: Without dead ends: 1606 [2021-01-06 14:14:20,645 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 14:14:20,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2021-01-06 14:14:20,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1072. [2021-01-06 14:14:20,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1072 states. [2021-01-06 14:14:20,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1228 transitions. [2021-01-06 14:14:20,682 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1228 transitions. Word has length 212 [2021-01-06 14:14:20,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:14:20,683 INFO L481 AbstractCegarLoop]: Abstraction has 1072 states and 1228 transitions. [2021-01-06 14:14:20,683 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:14:20,683 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1228 transitions. [2021-01-06 14:14:20,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2021-01-06 14:14:20,689 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:14:20,690 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 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, 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:14:20,903 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:14:20,903 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:14:20,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:14:20,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1162148433, now seen corresponding path program 1 times [2021-01-06 14:14:20,905 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:14:20,906 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543741987] [2021-01-06 14:14:20,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:14:20,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:14:21,186 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 270 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-01-06 14:14:21,188 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543741987] [2021-01-06 14:14:21,189 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:14:21,190 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 14:14:21,191 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461010818] [2021-01-06 14:14:21,191 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:14:21,192 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:14:21,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:14:21,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:14:21,193 INFO L87 Difference]: Start difference. First operand 1072 states and 1228 transitions. Second operand 3 states. [2021-01-06 14:14:22,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:14:22,033 INFO L93 Difference]: Finished difference Result 2676 states and 3103 transitions. [2021-01-06 14:14:22,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:14:22,034 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 299 [2021-01-06 14:14:22,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:14:22,042 INFO L225 Difference]: With dead ends: 2676 [2021-01-06 14:14:22,042 INFO L226 Difference]: Without dead ends: 1606 [2021-01-06 14:14:22,044 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 [2021-01-06 14:14:22,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2021-01-06 14:14:22,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1606. [2021-01-06 14:14:22,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1606 states. [2021-01-06 14:14:22,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 1801 transitions. [2021-01-06 14:14:22,075 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 1801 transitions. Word has length 299 [2021-01-06 14:14:22,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:14:22,076 INFO L481 AbstractCegarLoop]: Abstraction has 1606 states and 1801 transitions. [2021-01-06 14:14:22,076 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:14:22,076 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 1801 transitions. [2021-01-06 14:14:22,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2021-01-06 14:14:22,085 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:14:22,086 INFO L422 BasicCegarLoop]: trace histogram [6, 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, 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, 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] [2021-01-06 14:14:22,086 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 14:14:22,086 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:14:22,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:14:22,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1381783312, now seen corresponding path program 1 times [2021-01-06 14:14:22,087 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:14:22,088 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417871114] [2021-01-06 14:14:22,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:14:22,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:14:22,516 INFO L134 CoverageAnalysis]: Checked inductivity of 901 backedges. 583 proven. 0 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2021-01-06 14:14:22,517 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417871114] [2021-01-06 14:14:22,517 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:14:22,517 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 14:14:22,518 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333032595] [2021-01-06 14:14:22,518 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 14:14:22,518 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:14:22,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 14:14:22,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 14:14:22,519 INFO L87 Difference]: Start difference. First operand 1606 states and 1801 transitions. Second operand 4 states. [2021-01-06 14:14:23,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:14:23,437 INFO L93 Difference]: Finished difference Result 3061 states and 3453 transitions. [2021-01-06 14:14:23,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 14:14:23,437 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 485 [2021-01-06 14:14:23,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:14:23,447 INFO L225 Difference]: With dead ends: 3061 [2021-01-06 14:14:23,447 INFO L226 Difference]: Without dead ends: 1784 [2021-01-06 14:14:23,449 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 [2021-01-06 14:14:23,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1784 states. [2021-01-06 14:14:23,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1784 to 1606. [2021-01-06 14:14:23,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1606 states. [2021-01-06 14:14:23,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 1740 transitions. [2021-01-06 14:14:23,479 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 1740 transitions. Word has length 485 [2021-01-06 14:14:23,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:14:23,480 INFO L481 AbstractCegarLoop]: Abstraction has 1606 states and 1740 transitions. [2021-01-06 14:14:23,480 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 14:14:23,480 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 1740 transitions. [2021-01-06 14:14:23,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 512 [2021-01-06 14:14:23,492 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:14:23,492 INFO L422 BasicCegarLoop]: trace histogram [6, 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, 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, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 14:14:23,492 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 14:14:23,493 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:14:23,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:14:23,496 INFO L82 PathProgramCache]: Analyzing trace with hash -2085699249, now seen corresponding path program 1 times [2021-01-06 14:14:23,496 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:14:23,496 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114328311] [2021-01-06 14:14:23,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:14:23,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:14:24,446 INFO L134 CoverageAnalysis]: Checked inductivity of 978 backedges. 639 proven. 11 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2021-01-06 14:14:24,446 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114328311] [2021-01-06 14:14:24,446 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498133262] [2021-01-06 14:14:24,446 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 [2021-01-06 14:14:24,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:14:24,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 689 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 14:14:24,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 14:14:25,599 INFO L134 CoverageAnalysis]: Checked inductivity of 978 backedges. 334 proven. 0 refuted. 0 times theorem prover too weak. 644 trivial. 0 not checked. [2021-01-06 14:14:25,599 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 14:14:25,599 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2021-01-06 14:14:25,600 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533184862] [2021-01-06 14:14:25,601 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:14:25,601 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:14:25,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:14:25,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-01-06 14:14:25,602 INFO L87 Difference]: Start difference. First operand 1606 states and 1740 transitions. Second operand 3 states. [2021-01-06 14:14:26,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:14:26,382 INFO L93 Difference]: Finished difference Result 3032 states and 3302 transitions. [2021-01-06 14:14:26,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:14:26,383 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 511 [2021-01-06 14:14:26,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:14:26,393 INFO L225 Difference]: With dead ends: 3032 [2021-01-06 14:14:26,394 INFO L226 Difference]: Without dead ends: 1606 [2021-01-06 14:14:26,397 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 514 GetRequests, 510 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-01-06 14:14:26,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2021-01-06 14:14:26,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1606. [2021-01-06 14:14:26,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1606 states. [2021-01-06 14:14:26,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 1700 transitions. [2021-01-06 14:14:26,433 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 1700 transitions. Word has length 511 [2021-01-06 14:14:26,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:14:26,434 INFO L481 AbstractCegarLoop]: Abstraction has 1606 states and 1700 transitions. [2021-01-06 14:14:26,434 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:14:26,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 1700 transitions. [2021-01-06 14:14:26,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 579 [2021-01-06 14:14:26,439 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:14:26,440 INFO L422 BasicCegarLoop]: trace histogram [6, 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, 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, 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] [2021-01-06 14:14:26,654 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-01-06 14:14:26,654 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:14:26,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:14:26,655 INFO L82 PathProgramCache]: Analyzing trace with hash -738720952, now seen corresponding path program 1 times [2021-01-06 14:14:26,656 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:14:26,656 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612721009] [2021-01-06 14:14:26,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:14:26,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:14:27,251 INFO L134 CoverageAnalysis]: Checked inductivity of 978 backedges. 650 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2021-01-06 14:14:27,252 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612721009] [2021-01-06 14:14:27,252 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:14:27,253 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 14:14:27,253 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685499966] [2021-01-06 14:14:27,254 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:14:27,254 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:14:27,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:14:27,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:14:27,255 INFO L87 Difference]: Start difference. First operand 1606 states and 1700 transitions. Second operand 3 states. [2021-01-06 14:14:27,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:14:27,884 INFO L93 Difference]: Finished difference Result 3210 states and 3448 transitions. [2021-01-06 14:14:27,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:14:27,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 578 [2021-01-06 14:14:27,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:14:27,898 INFO L225 Difference]: With dead ends: 3210 [2021-01-06 14:14:27,898 INFO L226 Difference]: Without dead ends: 1962 [2021-01-06 14:14:27,901 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 [2021-01-06 14:14:27,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2021-01-06 14:14:27,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1784. [2021-01-06 14:14:27,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1784 states. [2021-01-06 14:14:27,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 1888 transitions. [2021-01-06 14:14:27,935 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 1888 transitions. Word has length 578 [2021-01-06 14:14:27,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:14:27,936 INFO L481 AbstractCegarLoop]: Abstraction has 1784 states and 1888 transitions. [2021-01-06 14:14:27,936 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:14:27,937 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 1888 transitions. [2021-01-06 14:14:27,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 586 [2021-01-06 14:14:27,941 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:14:27,942 INFO L422 BasicCegarLoop]: trace histogram [6, 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, 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, 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] [2021-01-06 14:14:27,942 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 14:14:27,942 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:14:27,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:14:27,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1524498877, now seen corresponding path program 1 times [2021-01-06 14:14:27,943 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:14:27,943 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929968562] [2021-01-06 14:14:27,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:14:28,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:14:28,382 INFO L134 CoverageAnalysis]: Checked inductivity of 985 backedges. 657 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2021-01-06 14:14:28,382 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929968562] [2021-01-06 14:14:28,382 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:14:28,382 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 14:14:28,383 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993074843] [2021-01-06 14:14:28,385 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:14:28,385 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:14:28,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:14:28,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:14:28,387 INFO L87 Difference]: Start difference. First operand 1784 states and 1888 transitions. Second operand 3 states. [2021-01-06 14:14:29,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:14:29,157 INFO L93 Difference]: Finished difference Result 3744 states and 4006 transitions. [2021-01-06 14:14:29,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:14:29,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 585 [2021-01-06 14:14:29,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:14:29,168 INFO L225 Difference]: With dead ends: 3744 [2021-01-06 14:14:29,168 INFO L226 Difference]: Without dead ends: 2318 [2021-01-06 14:14:29,171 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 [2021-01-06 14:14:29,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2318 states. [2021-01-06 14:14:29,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2318 to 2318. [2021-01-06 14:14:29,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2318 states. [2021-01-06 14:14:29,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 2450 transitions. [2021-01-06 14:14:29,211 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 2450 transitions. Word has length 585 [2021-01-06 14:14:29,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:14:29,212 INFO L481 AbstractCegarLoop]: Abstraction has 2318 states and 2450 transitions. [2021-01-06 14:14:29,212 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:14:29,212 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 2450 transitions. [2021-01-06 14:14:29,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 708 [2021-01-06 14:14:29,218 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:14:29,219 INFO L422 BasicCegarLoop]: trace histogram [7, 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, 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, 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] [2021-01-06 14:14:29,219 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 14:14:29,219 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:14:29,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:14:29,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1712906986, now seen corresponding path program 1 times [2021-01-06 14:14:29,220 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:14:29,221 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159560472] [2021-01-06 14:14:29,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:14:29,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:14:30,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1507 backedges. 1027 proven. 68 refuted. 0 times theorem prover too weak. 412 trivial. 0 not checked. [2021-01-06 14:14:30,212 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159560472] [2021-01-06 14:14:30,212 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1279627536] [2021-01-06 14:14:30,212 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 [2021-01-06 14:14:30,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:14:30,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 14:14:30,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 14:14:31,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1507 backedges. 1095 proven. 0 refuted. 0 times theorem prover too weak. 412 trivial. 0 not checked. [2021-01-06 14:14:31,515 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 14:14:31,515 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2021-01-06 14:14:31,515 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227687489] [2021-01-06 14:14:31,516 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 14:14:31,516 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:14:31,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 14:14:31,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-01-06 14:14:31,517 INFO L87 Difference]: Start difference. First operand 2318 states and 2450 transitions. Second operand 4 states. [2021-01-06 14:14:32,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:14:32,577 INFO L93 Difference]: Finished difference Result 4278 states and 4539 transitions. [2021-01-06 14:14:32,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 14:14:32,578 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 707 [2021-01-06 14:14:32,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:14:32,590 INFO L225 Difference]: With dead ends: 4278 [2021-01-06 14:14:32,590 INFO L226 Difference]: Without dead ends: 2318 [2021-01-06 14:14:32,593 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 710 GetRequests, 705 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-01-06 14:14:32,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2318 states. [2021-01-06 14:14:32,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2318 to 2140. [2021-01-06 14:14:32,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2140 states. [2021-01-06 14:14:32,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 2140 states and 2269 transitions. [2021-01-06 14:14:32,631 INFO L78 Accepts]: Start accepts. Automaton has 2140 states and 2269 transitions. Word has length 707 [2021-01-06 14:14:32,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:14:32,632 INFO L481 AbstractCegarLoop]: Abstraction has 2140 states and 2269 transitions. [2021-01-06 14:14:32,632 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 14:14:32,633 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 2269 transitions. [2021-01-06 14:14:32,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 715 [2021-01-06 14:14:32,638 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:14:32,639 INFO L422 BasicCegarLoop]: trace histogram [7, 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, 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, 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] [2021-01-06 14:14:32,852 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:14:32,853 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:14:32,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:14:32,854 INFO L82 PathProgramCache]: Analyzing trace with hash 236007803, now seen corresponding path program 1 times [2021-01-06 14:14:32,855 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:14:32,855 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615062696] [2021-01-06 14:14:32,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:14:32,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:14:33,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 1016 proven. 93 refuted. 0 times theorem prover too weak. 412 trivial. 0 not checked. [2021-01-06 14:14:33,920 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615062696] [2021-01-06 14:14:33,920 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845990786] [2021-01-06 14:14:33,920 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 [2021-01-06 14:14:34,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:14:34,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 917 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 14:14:34,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 14:14:35,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 1109 proven. 0 refuted. 0 times theorem prover too weak. 412 trivial. 0 not checked. [2021-01-06 14:14:35,181 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 14:14:35,181 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2021-01-06 14:14:35,181 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702115494] [2021-01-06 14:14:35,182 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:14:35,182 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:14:35,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:14:35,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 14:14:35,183 INFO L87 Difference]: Start difference. First operand 2140 states and 2269 transitions. Second operand 3 states. [2021-01-06 14:14:35,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:14:35,886 INFO L93 Difference]: Finished difference Result 4100 states and 4357 transitions. [2021-01-06 14:14:35,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:14:35,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 714 [2021-01-06 14:14:35,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:14:35,897 INFO L225 Difference]: With dead ends: 4100 [2021-01-06 14:14:35,897 INFO L226 Difference]: Without dead ends: 2140 [2021-01-06 14:14:35,900 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 717 GetRequests, 713 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 14:14:35,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2021-01-06 14:14:35,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 2140. [2021-01-06 14:14:35,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2140 states. [2021-01-06 14:14:35,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 2140 states and 2256 transitions. [2021-01-06 14:14:35,936 INFO L78 Accepts]: Start accepts. Automaton has 2140 states and 2256 transitions. Word has length 714 [2021-01-06 14:14:35,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:14:35,937 INFO L481 AbstractCegarLoop]: Abstraction has 2140 states and 2256 transitions. [2021-01-06 14:14:35,937 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:14:35,937 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 2256 transitions. [2021-01-06 14:14:35,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 741 [2021-01-06 14:14:35,944 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:14:35,945 INFO L422 BasicCegarLoop]: trace histogram [7, 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, 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, 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] [2021-01-06 14:14:36,159 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-01-06 14:14:36,160 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:14:36,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:14:36,161 INFO L82 PathProgramCache]: Analyzing trace with hash 541353436, now seen corresponding path program 1 times [2021-01-06 14:14:36,161 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:14:36,162 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371356233] [2021-01-06 14:14:36,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:14:36,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:14:36,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1547 backedges. 1064 proven. 155 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2021-01-06 14:14:36,795 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371356233] [2021-01-06 14:14:36,796 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540225582] [2021-01-06 14:14:36,796 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 [2021-01-06 14:14:37,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:14:37,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 946 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 14:14:37,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 14:14:38,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1547 backedges. 1064 proven. 155 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2021-01-06 14:14:38,262 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 14:14:38,263 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2021-01-06 14:14:38,263 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479403037] [2021-01-06 14:14:38,264 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 14:14:38,265 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:14:38,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 14:14:38,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 14:14:38,266 INFO L87 Difference]: Start difference. First operand 2140 states and 2256 transitions. Second operand 4 states. [2021-01-06 14:14:39,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:14:39,313 INFO L93 Difference]: Finished difference Result 4814 states and 5113 transitions. [2021-01-06 14:14:39,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 14:14:39,314 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 740 [2021-01-06 14:14:39,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:14:39,328 INFO L225 Difference]: With dead ends: 4814 [2021-01-06 14:14:39,328 INFO L226 Difference]: Without dead ends: 2854 [2021-01-06 14:14:39,331 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 743 GetRequests, 741 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 14:14:39,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2854 states. [2021-01-06 14:14:39,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2854 to 2852. [2021-01-06 14:14:39,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2852 states. [2021-01-06 14:14:39,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 3022 transitions. [2021-01-06 14:14:39,394 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 3022 transitions. Word has length 740 [2021-01-06 14:14:39,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:14:39,396 INFO L481 AbstractCegarLoop]: Abstraction has 2852 states and 3022 transitions. [2021-01-06 14:14:39,396 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 14:14:39,396 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 3022 transitions. [2021-01-06 14:14:39,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 813 [2021-01-06 14:14:39,404 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:14:39,405 INFO L422 BasicCegarLoop]: trace histogram [8, 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, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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] [2021-01-06 14:14:39,619 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-01-06 14:14:39,620 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:14:39,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:14:39,621 INFO L82 PathProgramCache]: Analyzing trace with hash 2015172220, now seen corresponding path program 1 times [2021-01-06 14:14:39,622 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:14:39,622 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109938908] [2021-01-06 14:14:39,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:14:39,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:14:40,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1990 backedges. 1255 proven. 0 refuted. 0 times theorem prover too weak. 735 trivial. 0 not checked. [2021-01-06 14:14:40,234 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109938908] [2021-01-06 14:14:40,234 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:14:40,234 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 14:14:40,234 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449567951] [2021-01-06 14:14:40,235 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:14:40,236 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:14:40,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:14:40,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:14:40,236 INFO L87 Difference]: Start difference. First operand 2852 states and 3022 transitions. Second operand 3 states. [2021-01-06 14:14:40,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:14:40,957 INFO L93 Difference]: Finished difference Result 6592 states and 7010 transitions. [2021-01-06 14:14:40,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:14:40,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 812 [2021-01-06 14:14:40,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:14:40,983 INFO L225 Difference]: With dead ends: 6592 [2021-01-06 14:14:40,984 INFO L226 Difference]: Without dead ends: 3920 [2021-01-06 14:14:40,991 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 [2021-01-06 14:14:40,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3920 states. [2021-01-06 14:14:41,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3920 to 3742. [2021-01-06 14:14:41,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3742 states. [2021-01-06 14:14:41,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3742 states to 3742 states and 3950 transitions. [2021-01-06 14:14:41,067 INFO L78 Accepts]: Start accepts. Automaton has 3742 states and 3950 transitions. Word has length 812 [2021-01-06 14:14:41,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:14:41,068 INFO L481 AbstractCegarLoop]: Abstraction has 3742 states and 3950 transitions. [2021-01-06 14:14:41,068 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:14:41,068 INFO L276 IsEmpty]: Start isEmpty. Operand 3742 states and 3950 transitions. [2021-01-06 14:14:41,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 831 [2021-01-06 14:14:41,076 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:14:41,077 INFO L422 BasicCegarLoop]: trace histogram [8, 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, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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] [2021-01-06 14:14:41,077 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 14:14:41,077 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:14:41,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:14:41,078 INFO L82 PathProgramCache]: Analyzing trace with hash 223131465, now seen corresponding path program 1 times [2021-01-06 14:14:41,078 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:14:41,079 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276516213] [2021-01-06 14:14:41,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:14:41,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:14:42,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2008 backedges. 1347 proven. 93 refuted. 0 times theorem prover too weak. 568 trivial. 0 not checked. [2021-01-06 14:14:42,344 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276516213] [2021-01-06 14:14:42,344 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872887328] [2021-01-06 14:14:42,344 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 [2021-01-06 14:14:42,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:14:42,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 1058 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 14:14:42,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 14:14:43,732 INFO L134 CoverageAnalysis]: Checked inductivity of 2008 backedges. 1440 proven. 0 refuted. 0 times theorem prover too weak. 568 trivial. 0 not checked. [2021-01-06 14:14:43,733 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 14:14:43,733 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2021-01-06 14:14:43,733 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170822437] [2021-01-06 14:14:43,735 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:14:43,735 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:14:43,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:14:43,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 14:14:43,736 INFO L87 Difference]: Start difference. First operand 3742 states and 3950 transitions. Second operand 3 states. [2021-01-06 14:14:44,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:14:44,454 INFO L93 Difference]: Finished difference Result 7660 states and 8081 transitions. [2021-01-06 14:14:44,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:14:44,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 830 [2021-01-06 14:14:44,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:14:44,467 INFO L225 Difference]: With dead ends: 7660 [2021-01-06 14:14:44,468 INFO L226 Difference]: Without dead ends: 4098 [2021-01-06 14:14:44,472 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 833 GetRequests, 829 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 14:14:44,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4098 states. [2021-01-06 14:14:44,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4098 to 3742. [2021-01-06 14:14:44,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3742 states. [2021-01-06 14:14:44,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3742 states to 3742 states and 3950 transitions. [2021-01-06 14:14:44,535 INFO L78 Accepts]: Start accepts. Automaton has 3742 states and 3950 transitions. Word has length 830 [2021-01-06 14:14:44,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:14:44,536 INFO L481 AbstractCegarLoop]: Abstraction has 3742 states and 3950 transitions. [2021-01-06 14:14:44,536 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:14:44,536 INFO L276 IsEmpty]: Start isEmpty. Operand 3742 states and 3950 transitions. [2021-01-06 14:14:44,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 870 [2021-01-06 14:14:44,547 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:14:44,548 INFO L422 BasicCegarLoop]: trace histogram [8, 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, 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, 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] [2021-01-06 14:14:44,762 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-01-06 14:14:44,763 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:14:44,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:14:44,764 INFO L82 PathProgramCache]: Analyzing trace with hash 490491138, now seen corresponding path program 1 times [2021-01-06 14:14:44,764 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:14:44,764 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364027330] [2021-01-06 14:14:44,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:14:44,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:14:46,093 INFO L134 CoverageAnalysis]: Checked inductivity of 2212 backedges. 1531 proven. 260 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2021-01-06 14:14:46,094 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364027330] [2021-01-06 14:14:46,094 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972157140] [2021-01-06 14:14:46,094 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 [2021-01-06 14:14:46,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:14:46,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 1097 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 14:14:46,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 14:14:47,700 INFO L134 CoverageAnalysis]: Checked inductivity of 2212 backedges. 1477 proven. 0 refuted. 0 times theorem prover too weak. 735 trivial. 0 not checked. [2021-01-06 14:14:47,700 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 14:14:47,701 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2021-01-06 14:14:47,701 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57224038] [2021-01-06 14:14:47,702 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 14:14:47,702 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:14:47,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 14:14:47,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-06 14:14:47,703 INFO L87 Difference]: Start difference. First operand 3742 states and 3950 transitions. Second operand 4 states. [2021-01-06 14:14:48,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:14:48,775 INFO L93 Difference]: Finished difference Result 7482 states and 7899 transitions. [2021-01-06 14:14:48,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 14:14:48,776 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 869 [2021-01-06 14:14:48,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:14:48,784 INFO L225 Difference]: With dead ends: 7482 [2021-01-06 14:14:48,785 INFO L226 Difference]: Without dead ends: 3920 [2021-01-06 14:14:48,789 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 873 GetRequests, 867 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-06 14:14:48,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3920 states. [2021-01-06 14:14:48,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3920 to 3742. [2021-01-06 14:14:48,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3742 states. [2021-01-06 14:14:48,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3742 states to 3742 states and 3946 transitions. [2021-01-06 14:14:48,849 INFO L78 Accepts]: Start accepts. Automaton has 3742 states and 3946 transitions. Word has length 869 [2021-01-06 14:14:48,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:14:48,850 INFO L481 AbstractCegarLoop]: Abstraction has 3742 states and 3946 transitions. [2021-01-06 14:14:48,850 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 14:14:48,850 INFO L276 IsEmpty]: Start isEmpty. Operand 3742 states and 3946 transitions. [2021-01-06 14:14:48,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 899 [2021-01-06 14:14:48,860 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:14:48,860 INFO L422 BasicCegarLoop]: trace histogram [8, 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, 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, 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] [2021-01-06 14:14:49,073 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-01-06 14:14:49,074 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:14:49,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:14:49,075 INFO L82 PathProgramCache]: Analyzing trace with hash 155205523, now seen corresponding path program 1 times [2021-01-06 14:14:49,076 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:14:49,076 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013995847] [2021-01-06 14:14:49,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:14:49,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:14:49,859 INFO L134 CoverageAnalysis]: Checked inductivity of 2267 backedges. 1532 proven. 0 refuted. 0 times theorem prover too weak. 735 trivial. 0 not checked. [2021-01-06 14:14:49,859 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013995847] [2021-01-06 14:14:49,862 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:14:49,862 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 14:14:49,864 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519958370] [2021-01-06 14:14:49,866 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:14:49,866 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:14:49,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:14:49,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:14:49,867 INFO L87 Difference]: Start difference. First operand 3742 states and 3946 transitions. Second operand 3 states. [2021-01-06 14:14:50,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:14:50,672 INFO L93 Difference]: Finished difference Result 7482 states and 7924 transitions. [2021-01-06 14:14:50,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:14:50,673 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 898 [2021-01-06 14:14:50,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:14:50,680 INFO L225 Difference]: With dead ends: 7482 [2021-01-06 14:14:50,681 INFO L226 Difference]: Without dead ends: 3920 [2021-01-06 14:14:50,685 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 [2021-01-06 14:14:50,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3920 states. [2021-01-06 14:14:50,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3920 to 3920. [2021-01-06 14:14:50,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3920 states. [2021-01-06 14:14:50,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3920 states to 3920 states and 4122 transitions. [2021-01-06 14:14:50,747 INFO L78 Accepts]: Start accepts. Automaton has 3920 states and 4122 transitions. Word has length 898 [2021-01-06 14:14:50,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:14:50,748 INFO L481 AbstractCegarLoop]: Abstraction has 3920 states and 4122 transitions. [2021-01-06 14:14:50,748 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:14:50,748 INFO L276 IsEmpty]: Start isEmpty. Operand 3920 states and 4122 transitions. [2021-01-06 14:14:50,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 983 [2021-01-06 14:14:50,759 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:14:50,760 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 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, 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, 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] [2021-01-06 14:14:50,760 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 14:14:50,761 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:14:50,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:14:50,761 INFO L82 PathProgramCache]: Analyzing trace with hash 639787128, now seen corresponding path program 1 times [2021-01-06 14:14:50,761 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:14:50,762 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951875579] [2021-01-06 14:14:50,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:14:50,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:14:51,838 INFO L134 CoverageAnalysis]: Checked inductivity of 3153 backedges. 684 proven. 0 refuted. 0 times theorem prover too weak. 2469 trivial. 0 not checked. [2021-01-06 14:14:51,838 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951875579] [2021-01-06 14:14:51,839 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:14:51,839 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 14:14:51,839 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879690890] [2021-01-06 14:14:51,839 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:14:51,840 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:14:51,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:14:51,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:14:51,840 INFO L87 Difference]: Start difference. First operand 3920 states and 4122 transitions. Second operand 3 states. [2021-01-06 14:14:52,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:14:52,624 INFO L93 Difference]: Finished difference Result 8016 states and 8472 transitions. [2021-01-06 14:14:52,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:14:52,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 982 [2021-01-06 14:14:52,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:14:52,632 INFO L225 Difference]: With dead ends: 8016 [2021-01-06 14:14:52,632 INFO L226 Difference]: Without dead ends: 4276 [2021-01-06 14:14:52,636 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 [2021-01-06 14:14:52,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4276 states. [2021-01-06 14:14:52,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4276 to 4276. [2021-01-06 14:14:52,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4276 states. [2021-01-06 14:14:52,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4276 states to 4276 states and 4485 transitions. [2021-01-06 14:14:52,695 INFO L78 Accepts]: Start accepts. Automaton has 4276 states and 4485 transitions. Word has length 982 [2021-01-06 14:14:52,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:14:52,696 INFO L481 AbstractCegarLoop]: Abstraction has 4276 states and 4485 transitions. [2021-01-06 14:14:52,696 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:14:52,697 INFO L276 IsEmpty]: Start isEmpty. Operand 4276 states and 4485 transitions. [2021-01-06 14:14:52,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1031 [2021-01-06 14:14:52,709 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:14:52,710 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 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, 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, 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] [2021-01-06 14:14:52,710 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 14:14:52,710 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:14:52,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:14:52,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1422524928, now seen corresponding path program 1 times [2021-01-06 14:14:52,711 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:14:52,711 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677839083] [2021-01-06 14:14:52,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:14:52,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:14:53,783 INFO L134 CoverageAnalysis]: Checked inductivity of 3350 backedges. 2320 proven. 72 refuted. 0 times theorem prover too weak. 958 trivial. 0 not checked. [2021-01-06 14:14:53,784 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677839083] [2021-01-06 14:14:53,784 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294255452] [2021-01-06 14:14:53,784 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 [2021-01-06 14:14:54,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:14:54,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 1305 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-06 14:14:54,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 14:14:55,617 INFO L134 CoverageAnalysis]: Checked inductivity of 3350 backedges. 2033 proven. 0 refuted. 0 times theorem prover too weak. 1317 trivial. 0 not checked. [2021-01-06 14:14:55,617 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 14:14:55,617 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2021-01-06 14:14:55,618 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775735012] [2021-01-06 14:14:55,618 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 14:14:55,618 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:14:55,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 14:14:55,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-01-06 14:14:55,619 INFO L87 Difference]: Start difference. First operand 4276 states and 4485 transitions. Second operand 4 states. [2021-01-06 14:14:56,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:14:56,838 INFO L93 Difference]: Finished difference Result 9262 states and 9721 transitions. [2021-01-06 14:14:56,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 14:14:56,838 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1030 [2021-01-06 14:14:56,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:14:56,849 INFO L225 Difference]: With dead ends: 9262 [2021-01-06 14:14:56,849 INFO L226 Difference]: Without dead ends: 5166 [2021-01-06 14:14:56,854 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1034 GetRequests, 1029 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-01-06 14:14:56,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5166 states. [2021-01-06 14:14:56,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5166 to 4810. [2021-01-06 14:14:56,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4810 states. [2021-01-06 14:14:56,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4810 states to 4810 states and 5036 transitions. [2021-01-06 14:14:56,935 INFO L78 Accepts]: Start accepts. Automaton has 4810 states and 5036 transitions. Word has length 1030 [2021-01-06 14:14:56,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:14:56,937 INFO L481 AbstractCegarLoop]: Abstraction has 4810 states and 5036 transitions. [2021-01-06 14:14:56,937 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 14:14:56,937 INFO L276 IsEmpty]: Start isEmpty. Operand 4810 states and 5036 transitions. [2021-01-06 14:14:56,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1033 [2021-01-06 14:14:56,951 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:14:56,952 INFO L422 BasicCegarLoop]: trace histogram [9, 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, 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, 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] [2021-01-06 14:14:57,165 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-01-06 14:14:57,165 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:14:57,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:14:57,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1144724941, now seen corresponding path program 1 times [2021-01-06 14:14:57,167 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:14:57,167 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092105473] [2021-01-06 14:14:57,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:14:57,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:14:58,494 INFO L134 CoverageAnalysis]: Checked inductivity of 3054 backedges. 1841 proven. 0 refuted. 0 times theorem prover too weak. 1213 trivial. 0 not checked. [2021-01-06 14:14:58,495 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092105473] [2021-01-06 14:14:58,495 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:14:58,496 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 14:14:58,496 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702525990] [2021-01-06 14:14:58,497 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:14:58,497 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:14:58,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:14:58,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:14:58,498 INFO L87 Difference]: Start difference. First operand 4810 states and 5036 transitions. Second operand 3 states. [2021-01-06 14:14:59,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:14:59,231 INFO L93 Difference]: Finished difference Result 9796 states and 10250 transitions. [2021-01-06 14:14:59,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:14:59,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1032 [2021-01-06 14:14:59,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:14:59,244 INFO L225 Difference]: With dead ends: 9796 [2021-01-06 14:14:59,244 INFO L226 Difference]: Without dead ends: 4988 [2021-01-06 14:14:59,249 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 [2021-01-06 14:14:59,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4988 states. [2021-01-06 14:14:59,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4988 to 4632. [2021-01-06 14:14:59,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4632 states. [2021-01-06 14:14:59,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 4827 transitions. [2021-01-06 14:14:59,319 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 4827 transitions. Word has length 1032 [2021-01-06 14:14:59,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:14:59,320 INFO L481 AbstractCegarLoop]: Abstraction has 4632 states and 4827 transitions. [2021-01-06 14:14:59,320 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:14:59,320 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 4827 transitions. [2021-01-06 14:14:59,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1088 [2021-01-06 14:14:59,336 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:14:59,337 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 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, 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, 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] [2021-01-06 14:14:59,337 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-06 14:14:59,337 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:14:59,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:14:59,338 INFO L82 PathProgramCache]: Analyzing trace with hash 497922248, now seen corresponding path program 1 times [2021-01-06 14:14:59,338 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:14:59,338 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270015277] [2021-01-06 14:14:59,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:14:59,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:15:01,059 INFO L134 CoverageAnalysis]: Checked inductivity of 3628 backedges. 2444 proven. 325 refuted. 0 times theorem prover too weak. 859 trivial. 0 not checked. [2021-01-06 14:15:01,059 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270015277] [2021-01-06 14:15:01,059 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156550463] [2021-01-06 14:15:01,059 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 [2021-01-06 14:15:01,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:15:01,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 1359 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 14:15:01,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 14:15:03,109 INFO L134 CoverageAnalysis]: Checked inductivity of 3628 backedges. 2379 proven. 0 refuted. 0 times theorem prover too weak. 1249 trivial. 0 not checked. [2021-01-06 14:15:03,110 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 14:15:03,110 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2021-01-06 14:15:03,110 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494763763] [2021-01-06 14:15:03,111 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 14:15:03,112 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:15:03,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 14:15:03,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-06 14:15:03,112 INFO L87 Difference]: Start difference. First operand 4632 states and 4827 transitions. Second operand 4 states. [2021-01-06 14:15:04,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:15:04,231 INFO L93 Difference]: Finished difference Result 9262 states and 9653 transitions. [2021-01-06 14:15:04,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 14:15:04,232 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1087 [2021-01-06 14:15:04,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:15:04,242 INFO L225 Difference]: With dead ends: 9262 [2021-01-06 14:15:04,242 INFO L226 Difference]: Without dead ends: 4810 [2021-01-06 14:15:04,247 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1091 GetRequests, 1085 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-06 14:15:04,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4810 states. [2021-01-06 14:15:04,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4810 to 4632. [2021-01-06 14:15:04,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4632 states. [2021-01-06 14:15:04,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 4825 transitions. [2021-01-06 14:15:04,310 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 4825 transitions. Word has length 1087 [2021-01-06 14:15:04,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:15:04,311 INFO L481 AbstractCegarLoop]: Abstraction has 4632 states and 4825 transitions. [2021-01-06 14:15:04,311 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 14:15:04,311 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 4825 transitions. [2021-01-06 14:15:04,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1117 [2021-01-06 14:15:04,326 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:15:04,327 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 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, 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, 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] [2021-01-06 14:15:04,542 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:15:04,543 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:15:04,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:15:04,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1760046537, now seen corresponding path program 1 times [2021-01-06 14:15:04,544 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:15:04,545 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113482517] [2021-01-06 14:15:04,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:15:04,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:15:05,634 INFO L134 CoverageAnalysis]: Checked inductivity of 3686 backedges. 2437 proven. 0 refuted. 0 times theorem prover too weak. 1249 trivial. 0 not checked. [2021-01-06 14:15:05,634 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113482517] [2021-01-06 14:15:05,634 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:15:05,634 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 14:15:05,635 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121790140] [2021-01-06 14:15:05,635 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:15:05,635 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:15:05,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:15:05,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:15:05,636 INFO L87 Difference]: Start difference. First operand 4632 states and 4825 transitions. Second operand 3 states. [2021-01-06 14:15:06,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:15:06,383 INFO L93 Difference]: Finished difference Result 9262 states and 9649 transitions. [2021-01-06 14:15:06,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:15:06,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1116 [2021-01-06 14:15:06,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:15:06,393 INFO L225 Difference]: With dead ends: 9262 [2021-01-06 14:15:06,394 INFO L226 Difference]: Without dead ends: 4810 [2021-01-06 14:15:06,399 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 [2021-01-06 14:15:06,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4810 states. [2021-01-06 14:15:06,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4810 to 4810. [2021-01-06 14:15:06,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4810 states. [2021-01-06 14:15:06,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4810 states to 4810 states and 4993 transitions. [2021-01-06 14:15:06,470 INFO L78 Accepts]: Start accepts. Automaton has 4810 states and 4993 transitions. Word has length 1116 [2021-01-06 14:15:06,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:15:06,471 INFO L481 AbstractCegarLoop]: Abstraction has 4810 states and 4993 transitions. [2021-01-06 14:15:06,472 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:15:06,472 INFO L276 IsEmpty]: Start isEmpty. Operand 4810 states and 4993 transitions. [2021-01-06 14:15:06,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1191 [2021-01-06 14:15:06,491 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:15:06,492 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 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, 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, 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] [2021-01-06 14:15:06,492 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-06 14:15:06,492 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:15:06,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:15:06,493 INFO L82 PathProgramCache]: Analyzing trace with hash -18007242, now seen corresponding path program 1 times [2021-01-06 14:15:06,493 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:15:06,493 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684012065] [2021-01-06 14:15:06,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:15:06,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:15:07,656 INFO L134 CoverageAnalysis]: Checked inductivity of 4055 backedges. 2206 proven. 0 refuted. 0 times theorem prover too weak. 1849 trivial. 0 not checked. [2021-01-06 14:15:07,657 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684012065] [2021-01-06 14:15:07,657 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:15:07,657 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 14:15:07,657 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484416560] [2021-01-06 14:15:07,658 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 14:15:07,658 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:15:07,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 14:15:07,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 14:15:07,659 INFO L87 Difference]: Start difference. First operand 4810 states and 4993 transitions. Second operand 3 states. [2021-01-06 14:15:08,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:15:08,452 INFO L93 Difference]: Finished difference Result 9440 states and 9805 transitions. [2021-01-06 14:15:08,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 14:15:08,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1190 [2021-01-06 14:15:08,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:15:08,462 INFO L225 Difference]: With dead ends: 9440 [2021-01-06 14:15:08,462 INFO L226 Difference]: Without dead ends: 4810 [2021-01-06 14:15:08,468 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 [2021-01-06 14:15:08,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4810 states. [2021-01-06 14:15:08,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4810 to 4632. [2021-01-06 14:15:08,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4632 states. [2021-01-06 14:15:08,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 4775 transitions. [2021-01-06 14:15:08,530 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 4775 transitions. Word has length 1190 [2021-01-06 14:15:08,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:15:08,531 INFO L481 AbstractCegarLoop]: Abstraction has 4632 states and 4775 transitions. [2021-01-06 14:15:08,531 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 14:15:08,531 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 4775 transitions. [2021-01-06 14:15:08,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1271 [2021-01-06 14:15:08,550 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:15:08,551 INFO L422 BasicCegarLoop]: trace histogram [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, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 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] [2021-01-06 14:15:08,551 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-01-06 14:15:08,552 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:15:08,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:15:08,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1118499440, now seen corresponding path program 1 times [2021-01-06 14:15:08,553 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:15:08,553 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538989757] [2021-01-06 14:15:08,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:15:08,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:15:10,139 INFO L134 CoverageAnalysis]: Checked inductivity of 5293 backedges. 3247 proven. 0 refuted. 0 times theorem prover too weak. 2046 trivial. 0 not checked. [2021-01-06 14:15:10,139 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538989757] [2021-01-06 14:15:10,139 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 14:15:10,140 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 14:15:10,140 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216135407] [2021-01-06 14:15:10,141 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 14:15:10,141 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 14:15:10,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 14:15:10,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 14:15:10,142 INFO L87 Difference]: Start difference. First operand 4632 states and 4775 transitions. Second operand 4 states. [2021-01-06 14:15:11,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 14:15:11,473 INFO L93 Difference]: Finished difference Result 9084 states and 9369 transitions. [2021-01-06 14:15:11,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 14:15:11,474 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1270 [2021-01-06 14:15:11,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 14:15:11,481 INFO L225 Difference]: With dead ends: 9084 [2021-01-06 14:15:11,481 INFO L226 Difference]: Without dead ends: 4632 [2021-01-06 14:15:11,486 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 [2021-01-06 14:15:11,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4632 states. [2021-01-06 14:15:11,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4632 to 4632. [2021-01-06 14:15:11,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4632 states. [2021-01-06 14:15:11,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 4748 transitions. [2021-01-06 14:15:11,545 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 4748 transitions. Word has length 1270 [2021-01-06 14:15:11,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 14:15:11,546 INFO L481 AbstractCegarLoop]: Abstraction has 4632 states and 4748 transitions. [2021-01-06 14:15:11,546 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 14:15:11,547 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 4748 transitions. [2021-01-06 14:15:11,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1440 [2021-01-06 14:15:11,566 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 14:15:11,567 INFO L422 BasicCegarLoop]: trace histogram [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, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 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] [2021-01-06 14:15:11,567 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-01-06 14:15:11,568 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 14:15:11,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 14:15:11,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1612134627, now seen corresponding path program 1 times [2021-01-06 14:15:11,569 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 14:15:11,569 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818415] [2021-01-06 14:15:11,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 14:15:11,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:15:14,152 INFO L134 CoverageAnalysis]: Checked inductivity of 5972 backedges. 2438 proven. 28 refuted. 0 times theorem prover too weak. 3506 trivial. 0 not checked. [2021-01-06 14:15:14,152 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818415] [2021-01-06 14:15:14,152 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22414052] [2021-01-06 14:15:14,153 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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 14:15:14,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 14:15:14,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 1758 conjuncts, 4 conjunts are in the unsatisfiable core [2021-01-06 14:15:14,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 14:15:15,746 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 14:15:15,748 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 14:15:15,757 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 14:15:15,759 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 14:15:15,822 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 14:15:15,856 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 14:15:15,865 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 14:15:15,876 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 14:15:15,884 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-06 14:15:16,050 INFO L757 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:15:16,242 INFO L757 QuantifierPusher]: Run 20 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:15:16,434 INFO L757 QuantifierPusher]: Run 30 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:15:16,690 INFO L757 QuantifierPusher]: Run 40 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:15:17,006 INFO L757 QuantifierPusher]: Run 50 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:15:17,922 INFO L757 QuantifierPusher]: Run 60 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:15:19,108 INFO L757 QuantifierPusher]: Run 70 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:15:20,603 INFO L757 QuantifierPusher]: Run 80 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:15:22,217 INFO L757 QuantifierPusher]: Run 90 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:15:24,104 INFO L757 QuantifierPusher]: Run 100 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:15:26,548 INFO L757 QuantifierPusher]: Run 110 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:15:28,510 INFO L757 QuantifierPusher]: Run 120 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:15:29,684 INFO L757 QuantifierPusher]: Run 130 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:15:30,361 INFO L757 QuantifierPusher]: Run 140 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:15:31,189 INFO L757 QuantifierPusher]: Run 150 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:15:32,107 INFO L757 QuantifierPusher]: Run 160 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:15:33,407 INFO L757 QuantifierPusher]: Run 170 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:15:34,696 INFO L757 QuantifierPusher]: Run 180 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:15:36,076 INFO L757 QuantifierPusher]: Run 190 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:15:37,364 INFO L757 QuantifierPusher]: Run 200 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:15:38,750 INFO L757 QuantifierPusher]: Run 210 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:15:40,298 INFO L757 QuantifierPusher]: Run 220 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:15:41,938 INFO L757 QuantifierPusher]: Run 230 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:15:43,668 INFO L757 QuantifierPusher]: Run 240 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:15:45,646 INFO L757 QuantifierPusher]: Run 250 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:15:48,016 INFO L757 QuantifierPusher]: Run 260 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:15:50,411 INFO L757 QuantifierPusher]: Run 270 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:15:52,989 INFO L757 QuantifierPusher]: Run 280 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:15:55,689 INFO L757 QuantifierPusher]: Run 290 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:15:58,369 INFO L757 QuantifierPusher]: Run 300 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:16:01,311 INFO L757 QuantifierPusher]: Run 310 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:16:04,392 INFO L757 QuantifierPusher]: Run 320 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:16:07,712 INFO L757 QuantifierPusher]: Run 330 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:16:11,395 INFO L757 QuantifierPusher]: Run 340 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:16:15,375 INFO L757 QuantifierPusher]: Run 350 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:16:19,630 INFO L757 QuantifierPusher]: Run 360 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:16:24,131 INFO L757 QuantifierPusher]: Run 370 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:16:29,332 INFO L757 QuantifierPusher]: Run 380 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:16:34,262 INFO L757 QuantifierPusher]: Run 390 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:16:39,234 INFO L757 QuantifierPusher]: Run 400 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:16:44,309 INFO L757 QuantifierPusher]: Run 410 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:16:49,518 INFO L757 QuantifierPusher]: Run 420 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:16:55,267 INFO L757 QuantifierPusher]: Run 430 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:17:01,355 INFO L757 QuantifierPusher]: Run 440 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:17:07,443 INFO L757 QuantifierPusher]: Run 450 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:17:14,139 INFO L757 QuantifierPusher]: Run 460 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:17:22,365 INFO L757 QuantifierPusher]: Run 470 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:17:31,509 INFO L757 QuantifierPusher]: Run 480 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:17:41,212 INFO L757 QuantifierPusher]: Run 490 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:17:49,074 INFO L757 QuantifierPusher]: Run 500 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:17:56,684 INFO L757 QuantifierPusher]: Run 510 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2021-01-06 14:18:04,576 INFO L757 QuantifierPusher]: Run 520 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug.